A combination of potential reduction steps and steepest descent steps for solving convex programming problems

DOI10.1002/NLA.268zbMath1071.90031OpenAlexW2109132106WikidataQ114852900 ScholiaQ114852900MaRDI QIDQ5317840

Yixun Shi

Publication date: 21 September 2005

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.268

zbMATH Keywords

convex programminginterior point methodpolynomial complexitysteepest descent methodprimal-dual potential reduction

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

An interior point parameterized central path following algorithm for linearly constrained convex programming

Cites Work

• Matrix Balancing on a Massively Parallel Connection Machine
• Unnamed Item

This page was built for publication: A combination of potential reduction steps and steepest descent steps for solving convex programming problems