A continuation method for solving convex programming problemsviafischer reformulation

DOI10.1080/02331939808844413zbMath0959.90037OpenAlexW2045880098MaRDI QIDQ4944417

Daicai Song, Zhenghua Lin

Publication date: 6 May 2001

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844413

zbMATH Keywords

global convergenceequivalent conditionconvex programming problems

Mathematics Subject Classification ID

Convex programming (90C25) Renewal theory (60K05)

Cites Work

• Unnamed Item
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• A new polynomial-time algorithm for linear programming
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• A combined homotopy interior point method for convex nonlinear programming
• A Newton-type method for positive-semidefinite linear complementarity problems
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Projective SUMT Method for Convex Programming
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• A path following algorithm for a class of convex programming problems
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Solving the Nonlinear Complementarity Problem by a Homotopy Method
• A special newton-type optimization method

This page was built for publication: A continuation method for solving convex programming problemsviafischer reformulation