A primal-dual infeasible-interior-point algorithm for linear programming

DOI10.1007/BF01582151zbMath0808.90093MaRDI QIDQ1315419

Kojima, Masakazu, Shinji Mizuno, Nimrod Megiddo

Publication date: 10 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

global convergence; primal-dual infeasible-interior-point algorithm; step length rule

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C05: Linear programming

90C51: Interior-point methods

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

The analyticity of interior-point-paths at strictly complementary solutions of linear programs, LOQO:an interior point code for quadratic programming, Unnamed Item, ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING, Solving linear systems in interior-point methods, A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems, A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems, A combined homotopy interior point method for the linear complementarity problem, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Steplengths in interior-point algorithms of quadratic programming, Global convergence in infeasible-interior-point algorithms, Superlinear convergence of infeasible-interior-point methods for linear programming, Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming, An infeasible-interior-point algorithm for linear complementarity problems, Polynomiality of infeasible-interior-point algorithms for linear programming, A predictor-corrector infeasible-interior-point algorithm for linear programming, A QMR-based interior-point algorithm for solving linear programs, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, Parallel interior-point method for linear and quadratic programs with special structure, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, An interior point potential reduction method for constrained equations, A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming, A generalized homogeneous and self-dual algorithm for linear programming, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Presolving in linear programming, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, An infeasible-interior-point algorithm using projections onto a convex set, An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence, A simplified homogeneous and self-dual linear programming algorithm and its implementation, A lower bound on the number of iterations of long-step primal-dual linear programming algorithms, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, New infeasible interior-point algorithm based on monomial method, The \(Q\) method for second order cone programming, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, The complexity of self-regular proximity based infeasible IPMs, Interior-point methods for linear programming: a review, Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†, Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A little theorem of the big \({\mathcal M}\) in interior point algorithms
• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• On some efficient interior point methods for nonlinear convex programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Symmetric indefinite systems for interior point methods
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• On the Implementation of a Primal-Dual Interior Point Method
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• Further Development of a Primal-Dual Interior Point Method
• Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
• A General Framework of Continuation Methods for Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming