scientific article; zbMATH DE number 2110459

zbMATH Open1069.90078MaRDI QIDQ4822983FDOQ4822983

Authors: Yixun Shi 

Publication date: 26 October 2004

Title of this publication is not available (Why is that?)

Recommendations

• A combination of potential reduction steps and steepest descent steps for solving convex programming problems
• A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems
• On combined phase 1-phase 2 projective methods for linear programming
• Two methods for minimizing convex functions in a class of nonconvex sets
• A potential reduction algorithm for linearly constrained convex programming

zbMATH Keywords

convex programminginterior point methodprimal-dual potential reductionprojected descent direction method

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Numerical computation of solutions to single equations (65H05)

Cited In (1)

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

This page was built for publication:

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