A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
From MaRDI portal
DOI10.1287/MOOR.15.2.191zbMATH Open0714.90060OpenAlexW2165452678MaRDI QIDQ3200877FDOQ3200877
Ilan Adler, Mauricio G. C. Resende, Renato D. C. Monteiro
Publication date: 1990
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b7b7e98a7d183f80c499be62456d90cc6793fe71
Recommendations
- scientific article; zbMATH DE number 4193461
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A new primal-dual polynomial algorithm for convex quadratic programming
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
convergence propertiespower series approximationlogarithmic barrier function approachprimal-dual path following algorithm
Quadratic programming (90C20) Convex programming (90C25) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (71)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- A dynamic large-update primal‐dual interior-point method for linear optimization
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- Constant potential primal-dual algorithms: A framework
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- A long-step barrier method for convex quadratic programming
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- Primal-dual target-following algorithms for linear programming
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- An unconstrained convex programming approach to solving convex quadratic programming problems
- Hopfield neural networks in large-scale linear optimization problems
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- Degeneracy in interior point methods for linear programming: A survey
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- Warm start by Hopfield neural networks for interior point methods
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Feasible direction interior-point technique for nonlinear optimization
- The primal power affine scaling method
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- On self-regular IPMs (with comments and rejoinder)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- A globally convergent primal-dual interior point algorithm for convex programming
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- New infeasible interior-point algorithm based on monomial method
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- A polynomial arc-search interior-point algorithm for linear programming
- Comparative analysis of affine scaling algorithms based on simplifying assumptions
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A survey of search directions in interior point methods for linear programming
- On the convergence of the affine-scaling algorithm
- Optimized choice of parameters in interior-point methods for linear programming
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- Interior-point methods for linear programming: a review
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
- An affine scaling method using a class of differential barrier functions: primal approach
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard
- On the symmetric affiine scaling algorithm for line programming*
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A quadratically convergent scaling newton’s method for nonlinear programming problems
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
- Analysis of some interior point continuous trajectories for convex programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
- A new potential reduction algorithm for smooth convex programming
This page was built for publication: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200877)
