Convergence behavior of interior-point algorithms
From MaRDI portal
Publication:689124
DOI10.1007/BF01580610zbMATH Open0803.90087OpenAlexW2050897335MaRDI QIDQ689124FDOQ689124
Publication date: 6 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580610
Recommendations
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- On the finite convergence of interior-point algorithms for linear programming
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- Local convergence of interior-point algorithms for degenerate monotone LCP
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Title not available (Why is that?)
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Title not available (Why is that?)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm for a class of linear complementarity problems
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Interior path following primal-dual algorithms. I: Linear programming
- Title not available (Why is that?)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Title not available (Why is that?)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
- A long-step barrier method for convex quadratic programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Title not available (Why is that?)
- A modification of Karmarkar's linear programming algorithm
- An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- A polynomial method of approximate centers for linear programming
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- Title not available (Why is that?)
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
Cited In (51)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- Interior-point methods for nonlinear complementarity problems
- Constant potential primal-dual algorithms: A framework
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- Characterizing the universal rigidity of generic frameworks
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- Input design for discrimination between classes of LTI models
- On the convergence rate of Newton interior-point methods in the absence of strict complementarity
- On the finite convergence of interior-point algorithms for linear programming
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
- Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- On the uniqueness of optimal strategies in symmetric matrix games
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Finding an interior point in the optimal face of linear programs
- Recovering an optimal LP basis from an interior point solution
- Analytic centers and repelling inequalities
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A primal-dual interior-point method for linear programming based on a weighted barrier function
- Substantiation of interior point algorithms
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- On self-regular IPMs (with comments and rejoinder)
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- On homogeneous and self-dual algorithms for LCP
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Quadratic regularizations in an interior-point method for primal block-angular problems
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- On the convergence of a predictor-corrector variant algorithm
- On parametric semidefinite programming
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
- Title not available (Why is that?)
- On the convergence of primal-dual interior-point methods with wide neighborhoods
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- On interior algorithms for linear programming with no regularity assumptions
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- Identifying the optimal partition in convex quadratic programming
- A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS
- Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization
- Conic convex programming and self-dual embedding
- On the probabilistic complexity of finding an approximate solution for linear programming
- Identifying an optimal basis in linear programming
- Theory of semidefinite programming for sensor network localization
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- General central path and the largest step general central path following algorithm for linear programming
This page was built for publication: Convergence behavior of interior-point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689124)
