Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
From MaRDI portal
Publication:1947198
DOI10.1007/s12532-012-0046-zzbMath1269.90080OpenAlexW2114416272MaRDI QIDQ1947198
Erling D. Andersen, Yinyu Ye, Anders Skajaa
Publication date: 12 April 2013
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-012-0046-z
Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51)
Related Items
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization, Accelerated proximal gradient method for bi-modulus static elasticity, Crash start of interior point methods, Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization, A guide to conic optimisation and its applications, A multilevel analysis of the Lasserre hierarchy, A new warmstarting strategy for the primal-dual column generation method, Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion, Active-set prediction for interior point methods using controlled perturbations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A warm-start approach for large-scale stochastic linear programs
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Modified barrier functions (theory and methods)
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Presolving in linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- On the Implementation of a Primal-Dual Interior Point Method
- On Finding Primal- and Dual-Optimal Bases
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Reoptimization With the Primal-Dual Interior Point Method
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Conic convex programming and self-dual embedding
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- Robust Portfolio Selection Problems
