Long-step strategies in interior-point primal-dual methods
From MaRDI portal
Publication:1361105
DOI10.1007/BF02614378zbMath0881.90108MaRDI QIDQ1361105
Publication date: 23 July 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
interior-point methodsself-concordant barrierpath-followingefficiency estimatesnonlinear conic problemsprimal-dual potential reduction
Related Items (12)
A wide neighborhood infeasible-interior-point method with arc-search for linear programming ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming ⋮ Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ On verified numerical computations in convex programming ⋮ Interior-point methods: An old and new approach to nonlinear programming ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ Parabolic target space and primal-dual interior-point methods ⋮ ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods ⋮ On the behavior of the homogeneous self-dual model for conic convex optimization ⋮ Computational experience with a modified potential reduction algorithm for linear programming ⋮ Towards non-symmetric conic optimization ⋮ Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial Newton method for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Complexity estimates of some cutting plane methods based on the analytic barrier
- On the Quadratic Convergence of the Simplified Mizuno--Todd--Ye Algorithm for Linear Programming
- A Centered Projective Algorithm for Linear Programming
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
This page was built for publication: Long-step strategies in interior-point primal-dual methods
