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 18 of 18 for “"Primal-Dual Interior Point Methods"”.
-
Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods
… theory and implementation of infeasible-start primal-dual interior-point methods for convex optimization problems. Convex optimization has applications in many fields of engineering and science such as data analysis, control theory, signal processing, relaxation and randomization, and robust …
-
On improving the accuracy of primal-dual interior point methods for linear programming
Implementations of the primal-dual approach in solving linear programming problems still face issues in maintaining numerical stability and in attaining high accuracy. The major source of numerical problems occurs during the solving of a highly ill-conditioned linear system within the algorithm. We …
-
Spectral properties of matrices arising from primal-dual interior-point methods for convex quadratic programs
The solution of convex quadratic programs using primal-dual interior-point methods has at its core the solution of a series of linear systems, which are in practice commonly reduced by block Gaussian elimination from the original unsymmetric block 3-by-3 formulation to either a block 2-by-2 …
-
Effective computation of the analytic center of the solution set in linear programming using primal-dual interior-point methods
… linear programming model that is in the relative interior of the solution set and one that is in some sense as far away as possible from the relative boundary. In this way the solution is robust and not affected by small changes in the data. In this work we study the effective computation of the …
-
On the role of indicators in identifying zero variables in linear programming
… We investigate the behavior of the Tapia and the primal-dual indicators in the framework of the recently proposed primal-dual interior-point methods. The structure of the solution set of the linear programming problem is closely examined. We prove the interesting result that the relative interior …
-
A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the …
-
New probabilistic inference algorithms that harness the strengths of variational and Monte Carlo methods
… based on stochastic approximation, variational methods and sequential Monte Carlo is proposed that achieves significant improvements in accuracy and reductions in variance over existing Monte Carlo and variational methods, and at a comparable computational expense, 2) for many instances of the …
-
Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming
… and superlinear convergence of a class of primal-dual interior-point methods were provided. A new approach for solving large-scale well-structured sparse SDPs via a saddle point mirror-prox algorithm with ${cal O}(epsilon^{-1})$ efficiency was developed based on exploiting sparsity …
-
Robust model predictive control as a class of semi-infinite programming problems
… in this thesis that some of the most promising methods of imparting robustness to MPC algorithms result in semi-infinite programs. These programs arise from the addition of semi-infinite constraints to the nominal MPC algorithms which come from theoretical arguments that guarantee stability of …
-
The Distance to Uncontrollability via Linear Matrix Inequalities
… via the Kalman-Yakubovich-Popov (KYP) lemma. The dual formulation is also considered and leads to rank conditions for exactness verification of the approximation. For the second algorithm, by Dumitrescu, Şicleru and Ştefan, a semidefinite programming problem is derived using a sum-of-squares …
-
Solving Saddle Point Formulations of Linear Programs with Frank-Wolfe
… LP solvers make use of the Simplex method and primal-dual interior-point methods which are able to provide accurate solutions in a reasonable amount of time for most problems. However, both the Simplex method and interior-point methods require solving a system of linear equations at each …
-
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 …
-
Regularisation methods for imaging from electrical measurements
… stable solution of which requires regularisation methods. Most common regularisation methods impose that the reconstructed image should be smooth. Such methods confer stability to the reconstruction process, but limit the capability of describing sharp variations in the sought parameter. In this …
-
Convergence Analysis of Generalized Primal-Dual Interior-Point Algorithms for Linear Optimization
… algorithms are the generalization of the classic primal-dual affine-scaling methods, and have a strong connection with the quasi-Newton method. Although the zeroth-order algorithms have the property of strict monotone decrease in both primal and dual objective values, they may not converge. We …
-
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
-
Low-frequency HVac transmission and distribution systems : planning and operation
… limits the application of HVdc technology to point-to point transmission links only. Thanks to advances in semiconductor materials and control methods, modern power converters make low-frequency HVac (LF-HVac) transmission systems possible. This new method of bulk power transmission overcomes …
-
ON THE COMPUTATION AND APPLICATION OF MULTI-PERIOD SECURITY-CONSTRAINED OPTIMAL POWER FLOW FOR REAL-TIME ELECTRICITY MARKET OPERATIONS
… augmented Lagrangian method, a step-controlled primal-dual interior point method, and a modified constrained cost variables method, are developed for reliable and efficient computation of large-scale nonsmooth optimal power flows. Numerical studies show that these techniques are reliable and …