On well definedness of the central path

DOI10.1023/A:1021768121263zbMath0941.90061OpenAlexW172506827MaRDI QIDQ1807813

L. M. Graña Drummond, Benar Fux Svaiter

Publication date: 19 December 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021768121263

zbMATH Keywords

convex programminglogarithmic barrier functionanalytic centerlinear constraintscentral path

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Analysis of some interior point continuous trajectories for convex programming, Trajectory-following methods for large-scale degenerate convex quadratic programming, Existence, uniqueness, and convergence of the regularized primal-dual central path, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, The Convergent Generalized Central Paths for Linearly Constrained Convex Programming, Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games, Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO, An interior point parameterized central path following algorithm for linearly constrained convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A polynomial-time algorithm, based on Newton's 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
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Convex Analysis