Potential reduction method for harmonically convex programming

DOI10.1007/BF02191742zbMath0827.90115MaRDI QIDQ1893464

Jos F. Sturm, Shu-Zhong Zhang

Publication date: 13 December 1995

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

zbMATH Keywords

polynomialitypotential reduction method\(\varepsilon\)-optimal solutionharmonic convexity

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

New complexity results for the Iri-Imai method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A multiplicative barrier function method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Conical projection algorithms for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Interior point algorithms for linear programming with inequality constraints
• Interior-point methods for convex programming
• A proof of the polynomiality of the Iri-Imai method
• Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems

This page was built for publication: Potential reduction method for harmonically convex programming