A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems

DOI10.1137/0802005zbMath0774.90063OpenAlexW1995195758MaRDI QIDQ4018385

Tamás Terlaky, Dick den Hertog, Cornelis Roos

Publication date: 16 January 1993

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

Full work available at URL: https://semanticscholar.org/paper/c26d69c35191e9efe32975590a64e427df2eb9ef

zbMATH Keywords

Newton methodsmooth convex programminganalytic center methodlarge-step path following

Mathematics Subject Classification ID

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

Related Items

A globally convergent primal-dual interior point algorithm for convex programming, On Davidon's collinear scaling algorithms for optimization, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, Potential reduction method for harmonically convex programming, On convex optimization with linear constraints, A combined homotopy interior point method for convex nonlinear programming, A primal-dual potential reduction method for problems involving matrix inequalities, Impproving the rate of convergence of the logarithmic barrier function method, An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming, A long-step barrier method for convex quadratic programming, On complexity of the translational-cut algorithm for convex minimax problems, Solving the discrete \(l_p\)-approximation problem by a method of centers, Quadratically constrained convex quadratic programmes: Faculty feasible regions, Minimal representation of convex regions defined by analytic functions, On infeasibility of systems of convex analytic inequalities, On the classical logarithmic barrier function method for a class of smooth convex programming problems