Primal-dual target-following algorithms for linear programming
From MaRDI portal
Publication:1915912
DOI10.1007/BF02206817zbMath0848.90083OpenAlexW1985564371MaRDI QIDQ1915912
Jean-Philippe Vial, Cornelis Roos, Tamás Terlaky, Benjamin Jansen
Publication date: 24 October 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02206817
convergence analysisinterior-point methodprimal-dual methodoptimalitycentralitycenteringDikin stepstarge-following
Related Items
The interior-point revolution in optimization: History, recent developments, and lasting consequences, Primal-dual target-following algorithms for linear programming, A note on the use of vector barrier parameters for interior-point methods, Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem, HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method, On the chaotic behavior of the primal–dual affine–scaling algorithm for linear optimization, An adaptive-step primal-dual interior point algorithm for linear optimization, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, Interior point methods 25 years later, A weighted-path-following method for symmetric cone linear complementarity problems, A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP, The Kantorovich theorem and interior point methods, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, Complexity analysis of a weighted-full-Newton step interior-point algorithm forP∗(κ)-LCP, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, Long-step interior-point algorithms for a class of variational inequalities with monotone operators, A polynomial-time weighted path-following interior-point algorithm for linear optimization, Using an interior point method for the master problem in a decomposition approach, Warm start of the primal-dual method applied in the cutting-plane scheme, On weighted centers for semidefinite programming, Sparsity in convex quadratic programming with interior point methods, The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path, Improving complexity of structured convex optimization problems using self-concordant barriers, The BPMPD interior point solver for convex quadratic problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scaling technique for finding the weighted analytic center of a polytope
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A geometric view of parametric linear programming
- A polynomial method of approximate centers for linear programming
- A new polynomial time method for a linear complementarity problem
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- The use of the optimal partition in a linear programming solution for postoptimal analysis
- Primal-dual target-following algorithms for linear programming
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
- On the Quadratic Convergence of the Simplified Mizuno--Todd--Ye Algorithm for Linear Programming
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming
- Path-Following Methods for Linear Programming
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
