Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 272 for “"interior point"”.
-
Interior point least squares estimation
… of a new class of optimization methods, interior point optimization algorithms, to the adaptive filtering problem. We develop a new recursive algorithm, called Interior Point Least Squares or IPLS, that can be efficiently implemented with a computational cost comparable to (but higher …
-
Scaling and Interior Point Methods in Optimization
… four algorithms that use either scaling or interior point methods for convex optimization problems; two of the algorithms use both.
-
Interior Point Cutting Plane Methods in Integer Programming
This thesis presents novel approaches that use interior point concepts in solving mixed integer programs. Particularly, we use the analytic center cutting plane method to improve three of the main components of the branch-and-bound algorithm: cutting planes, heuristics, and branching. First, we …
-
Interior-Point Algorithms Based on Primal-Dual Entropy
… based on primal-dual entropy in the context of interior point methods for linear programming. This new family contains previously proposed search directions in the context of primal-dual entropy. We analyze the new family of search directions by studying their primal-dual affine-scaling and …
-
Interior Point Optimization of Low-Thrust Spacecraft Trajectories
… based nonlinear programming method, called the interior point method, was used. The nonlinear programming method was chosen so that results from this work could be compared and contrasted with results from Spacecraft Trajectory Optimization Suite (STOpS), which uses heuristics to iterate towards …
-
Direct sparse matrix methods for interior point algorithms.
… programming solution methodology have focused on interior point algorithms. These are powerful new methods, achieving significant reductions in computer time for large LPs and solving problems significantly larger than previously possible. This dissertation describes the implementation of interior …
-
On primal-dual interior-point algorithms for convex optimisation
… thesis studies the theory and implementation of interior-point methods for convex optimisation. A number of important problems from mathematics and engineering can be cast naturally as convex optimisation problems, and a great many others have useful convex relaxations. Interior-point methods are …
-
On primal-dual interior-point algorithms for convex optimisation
… thesis studies the theory and implementation of interior-point methods for convex optimisation. A number of important problems from mathematics and engineering can be cast naturally as convex optimisation problems, and a great many others have useful convex relaxations. Interior-point methods are …
-
Advanced Interior Point Formulation for the Global Routing Problem
… a linear programming problem and solved using interior point method. This thesis investigates two new approaches to optimize the speed of solving global routing using Karmarkar’s interior point method, as well as the effect of combining various optimizations with these new approaches. The first …
-
Interior-point methods for linear and mixed complementarity problems
An infeasible interior-point method with backtracking line search is proposed to solve the linear complementarity and the general mixed complementarity problem. The standard nonlinear complementarity problem is a special case of the latter problem. The algorithm is based on a method for the general …
-
Reoptimization in interior-point methods with application to integer programming
… examines current reoptimization techniques for interior-point methods available in the literature and studies their efficacy in a branch-and-bound framework for 0/1 mixed integer programming problems. This work is motivated by the observation that there are instances of integer programming …
-
An inexact interior-point algorithm for conic convex optimization problems
… form.) Our algorithm belongs to the class of interior-point methods (IPMs), which have been associated with many recent theoretical and algorithmic advances in mathematical optimization. In an IPM one solves a family of slowly-varying optimization problems that converge in some sense to the …
-
Computational Study of Kernel - Based Interior - Point Method for LCP
… and analyzing a kernel-based primal-dual interior-point method (IPM) for solving LCP, we consider several, fairly general, eligible kernel functions. We show that the algorithm, with some of those kernel functions, has comparable complexity with the best complexity results obtained in the …
-
Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem
… equation. A kernel-based primal-dual Interior-Point Method (IPM) for solving LCP was introduced and analyzed. The class of kernel functions used in this thesis is a class of so-called eligible kernel functions that are fairly general. We have shown for a positive semi-definite matrix …
-
Inexact interior point methods for constrained convex quadratic optimization problems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms
-
Interior-point methods for minimization of potential energy functions of polypeptides
Interior-point methods to minimize nonlinear, nonconvex potential energy function of proteins constrained by the bounds on dihedral angles are proposed. The first approach uses a barrier function to transform the original problem into a sequence of subproblems. First-order necessary conditions are …
-
Augmentation preconditioning for saddle point systems arising from interior point methods
… solving linear systems arising from primal-dual interior point algorithms in linear and quadratic programming. The preconditioner has the attractive property of improved eigenvalue clustering with increased ill-conditioning of the (1,1) block of the saddle point matrix. We demonstrate performance …
Page 1 of 14