On well definedness of the central path

DOI10.1023/A:1021768121263MaRDI QIDQ1807813zbMATH OpenOpenAlexFDO

Authors L. M. Graña Drummond, B. F. 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

analytic centercentral pathconvex programminglinear constraintslogarithmic barrier function

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Welldefinedness and limiting behavior of the central path
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• On the central path for nonlinear semidefinite programming
• On the existence and convergence of the central path for convex programming and some duality results
• Two simple proofs for analyticity of the central path in linear programming.

Cites work

• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Convex Analysis
• scientific article; zbMATH DE number 46305 (Why is no real title available?)
• scientific article; zbMATH DE number 590363 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming

Cited in

(15)

• Examples of ill-behaved central paths in convex optimization
• Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
• Welldefinedness and limiting behavior of the central path
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
• On the central path for nonlinear semidefinite programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
• The convergent generalized central paths for linearly constrained convex programming
• Analysis of some interior point continuous trajectories for convex programming
• Existence, uniqueness, and convergence of the regularized primal-dual central path
• A DRS-based path-following algorithm for linear programming
• Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO

This page was built for publication: On well definedness of the central path

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