On convex optimization with linear constraints

DOI10.1007/BF02192087zbMath0838.90096OpenAlexW1990853333MaRDI QIDQ1905040

Yanyan Li

Publication date: 16 January 1996

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

Full work available at URL: https://doi.org/10.1007/bf02192087

zbMATH Keywords

method of centersNewton's methodinterior-point methodfast rate of convergence

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

• On some efficient interior point methods for nonlinear convex programming
• The Cutting-Plane Method for Solving Convex Programs
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On convex optimization with linear constraints