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

DOI10.1137/0802005zbMATH Open0774.90063OpenAlexW1995195758MaRDI QIDQ4018385FDOQ4018385

Authors: D. Den Hertog, C. Roos, Tamás Terlaky 

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

Recommendations

• scientific article; zbMATH DE number 45207
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Interior-point methods for convex programming
• Publication:4735039
• A path following algorithm for a class of convex programming problems

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)

Cited In (16)

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

This page was built for publication: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems

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