Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

DOI10.1137/0805003MaRDI QIDQ4764308zbMATH OpenOpenAlexFDO

Authors Shinji Mizuno, Masakazu Kojima, Michael J. Todd

Publication date 30 May 1995

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/8908

zbMATH Keywords

infeasible interior pointprimal-dual potential-reduction algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• An infeasible-interior-point potential-reduction algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
• A primal-dual infeasible interior point algorithm for semidefinite programming
• 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
• scientific article; zbMATH DE number 778139
• Infeasible constraint-reduced interior-point methods for linear optimization
• scientific article; zbMATH DE number 1281610
• A primal-infeasible interior point algorithm for linearly constrained convex programming

Cited in

(40)

• A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• A primal-dual variant of the Iri-Imai algorithm for linear programming
• A potential-reduction algorithm for linear complementarity problems
• Feasibility issues in a primal-dual interior-point method for linear programming
• Near boundary behavior of primal-dual potential reduction algorithms for linear programming
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
• scientific article; zbMATH DE number 1782596 (Why is no real title available?)
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• An infeasible-interior-point algorithm using projections onto a convex set
• Infeasible potential reduction algorithms for semidefinite programming
• An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• An infeasible-interior-point algorithm for linear complementarity problems
• Starting-point strategies for an infeasible potential reduction method
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Status determination by interior-point methods for convex optimization problems in domain-driven form
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• An adaptive infeasible interior-point algorithm for linear complementarity problems
• A still simpler way of introducing interior-point method for linear programming
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
• Computational experience with a modified potential reduction algorithm for linear programming
• Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
• A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
• A predictor-corrector infeasible-interior-point algorithm for linear programming
• An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
• A class of infeasible interior point algorithms for convex quadratic programming
• Potential-reduction methods in mathematical programming
• A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• Convergence analysis of an inexact potential reduction method for convex quadratic programming
• An infeasible-interior-point potential-reduction algorithm for linear programming
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
• Linear programming with stochastic elements: An on-line approach
• Global convergence in infeasible-interior-point algorithms
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
• Interior-point methods for linear programming: a review
• Deriving potential functions via a symmetry principle for nonlinear equations
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods

This page was built for publication: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764308)