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

DOI10.1002/NLA.268zbMATH Open1071.90031OpenAlexW2109132106WikidataQ114852900 ScholiaQ114852900MaRDI QIDQ5317840FDOQ5317840

Authors: 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

Recommendations

• A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems
• An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
• scientific article; zbMATH DE number 2110459
• A potential reduction algorithm for linearly constrained convex programming
• Potential-reduction methods in mathematical programming

zbMATH Keywords

convex programminginterior point methodpolynomial complexitysteepest descent methodprimal-dual potential reduction

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Title not available (Why is that?)
• Matrix Balancing on a Massively Parallel Connection Machine

Cited In (4)

• Title not available (Why is that?)
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• A potential reduction algorithm for linearly constrained convex programming
• A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems

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

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