• Corpus ID: 116411364

Optimization with Semidefinite, Quadratic and Linear Constraints

@inproceedings{Alizadeh1997OptimizationWS,
  title={Optimization with Semidefinite, Quadratic and Linear Constraints},
  author={Farid Alizadeh and Stefan Schmieta},
  year={1997}
}
We consider optimization problems where variables have either linear, or convex quadratic or semideenite constraints. First, we deene and characterize primal and dual nondegeneracy and strict complementarity conditions. Next, we develop primal-dual interior point methods for such problems and show that in the absence of degeneracy these algorithms are numerically stable. Finally we describe an implementation of our method and present numerical experiments with both degenerate and nondegenerate… 

Figures from this paper

Optimization Over Symmetric Cones
We consider the problem of optimizing a linear function over the intersection of an affine space and a special class of closed, convex cones, namely the symmetric cones over the reals. This problem
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
TLDR
The primal-dual Dikin-type affine scaling method is generalized to symmetric conic optimization using the notion of Euclidean Jordan algebras and is shown to be viable and robust when compared to SeDuMi, MOSEK and SDPT3.
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
TLDR
Under primal and dual nondegeneracy conditions, the quadratic convergence of Newton's method is established to the unique optimal solution of second-order conic optimization, which depends on the optimal partition of the problem, which can be identified from a bounded sequence of interior solutions.
A Continuation Method for the Linear Second-Order Cone Complementarity Problem
TLDR
It is proved that the algorithm approximates an optimum of the linear second-order cone complementarity problem in finite steps under certain conditions and it is shown that the system of nonlinear equations of the reformulation is nonsingular at optimum undercertain conditions.
Quadratic convergence of Newton ’ s method to the optimal solution of second-order conic optimization
Under strict complementarity and primal and dual nondegeneracy conditions we establish the quadratic convergence of Newton’s method to the unique strictly complementary optimal solution of
Handbook of Semidefinite Programming
TLDR
Conditions and an accurate semidefinite programming solver are described in The Journal of the SDPA family for solving large-scale SDPs and in Handbook on Semidefinitely Programming.
Unifying Optimal Partition Approach to Sensitivity Analysis in Conic Optimization
TLDR
A unifying geometric framework is presented that subsumes the concept of the optimal partition in linear programming and semidefinite programming and extends it to conic optimization and discusses briefly the properties of the optimize value function under such perturbations.
On implementing a primal-dual interior-point method for conic quadratic optimization
TLDR
The main features of the implementation are it is based on a homogeneous and self-dual model, it handles rotated quadratic cones directly, it employs a Mehrotra type predictor-corrector extension and sparse linear algebra to improve the computational efficiency and it exploits fixed variables which naturally occurs in many conic Quadratic optimization problems.
Second-order cone programming
TLDR
SOCP formulations are given for four examples: the convex quadratically constrained quadratic programming (QCQP) problem, problems involving fractional quadRatic functions, and many of the problems presented in the survey paper of Vandenberghe and Boyd as examples of SDPs can in fact be formulated as SOCPs and should be solved as such.
Solving symmetric indefinite systems in an interior-point method for second order cone programming
TLDR
An augmented system approach is proposed to overcome the stability problems of the standard normal equation based implementation of IPM and numerical experiments show that the new approach can improve the stability.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming
This paper provides a theoretical foundation for efficient interior-point algorithms for nonlinear programming problems expressed in conic form, when the cone and its associated barrier are
A primal-dual interior point algorithm for linear programming
This chapter presents an algorithm that works simultaneously on primal and dual linear programming problems and generates a sequence of pairs of their interior feasible solutions. Along the sequence
Complementarity and nondegeneracy in semidefinite programming
TLDR
It is shown that primal and dual nondegeneracy and strict complementarity all hold generically and Numerical experiments suggest probability distributions for the ranks ofX andZ which are consistent with the nondEGeneracy conditions.
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
TLDR
It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.
Interior path following primal-dual algorithms. part I: Linear programming
TLDR
A primal-dual interior point algorithm for linear programming problems which requires a total of O(n L) number of iterations to find the Newton direction associated with the Karush-Kuhn-Tucker system of equations which characterizes a solution of the logarithmic barrier function problem.
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
An interior point method for quadratically constrained convex quadratic programming is presented that is based on a logarithmic barrier function approach and terminates at a required accuracy of an
First and Second Order Analysis of Nonlinear Semideenite Programs
In this paper we study nonlinear semideenite programming problems. Convexity, duality and rst-order optimality conditions for such problems are presented. A second-order analysis is also given.
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
TLDR
The analogue of Karmarkar's projective transformation and logarithmic barrier function are built and this allows to extend “word by word” the method of KARMarkar for LP to QCQP and allows to obtain a similar polynomial worst-case bound for the number of iterations.
On the Nesterov-Todd Direction in Semidefinite Programming
TLDR
How the search directions for the Nesterov--Todd (NT) method can be computed efficiently and how they can be viewed as Newton directions are discussed and demonstrated.
A method of analytic centers for quadratically constrained convex quadratic programs
An interior point method is developed for maximizing a concave quadratic function under convex quadratic constraints. The algorithm constructs a sequence of nested convex sets and finds their
...
1
2
3
4
...