On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms

DOI10.1137/0802015zbMath0763.90066OpenAlexW1986705183MaRDI QIDQ4018396

Richard A. Tapia, Yin Zhang, John E. jun. Dennis

Publication date: 16 January 1993

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

Full work available at URL: http://hdl.handle.net/1911/101672

zbMATH Keywords

Newton's methodduality gapnondegeneracyconvergence rate analysis\(Q\)-superlinear convergenceinterior point primal-dual linear programming algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, Superlinear convergence of infeasible-interior-point methods for linear programming, A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming, Inexact primal-dual interior point iteration for linear programs in function spaces, Primal-dual nonlinear rescaling method for convex optimization, A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming, Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, A primal-dual interior-point method for linear programming based on a weighted barrier function, Linear programming with stochastic elements: An on-line approach, On the formulation and theory of the Newton interior-point method for nonlinear programming, A quadratically convergent scaling newton’s method for nonlinear complementarity problems, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Improving the rate of convergence of interior point methods for linear programming, Polynomial Interior Point Cutting Plane Methods, Convergence behavior of interior-point algorithms, On interior-point Newton algorithms for discretized optimal control problems with state constraints^∗, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Near boundary behavior of primal-dual potential reduction algorithms for linear programming, On the convergence of primal-dual interior-point methods with wide neighborhoods, Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems, On the convergence rate of Newton interior-point methods in the absence of strict complementarity, Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme, Degeneracy in interior point methods for linear programming: A survey, Primal-dual Newton-type interior-point method for topology optimization, On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP, Interior point methods for optimal control of discrete time systems, On the convergence of a predictor-corrector variant algorithm