A potential reduction algorithm for linearly constrained convex programming
From MaRDI portal
Publication:5953365
DOI10.1007/S11766-001-0013-3zbMATH Open1017.65057OpenAlexW82802491MaRDI QIDQ5953365FDOQ5953365
Authors: Ximing Liang 
Publication date: 1 September 2003
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-001-0013-3
Recommendations
- scientific article; zbMATH DE number 1791165
- A new potential reduction algorithm for smooth convex programming
- On some efficient interior point methods for nonlinear convex programming
- A combination of potential reduction steps and steepest descent steps for solving convex programming problems
- A globally convergent primal-dual interior point algorithm for convex programming
Cites Work
- Title not available (Why is that?)
- Test examples for nonlinear programming codes
- Two-Metric Projection Methods for Constrained Optimization
- Title not available (Why is that?)
- On the convergence of projected gradient processes to singular critical points
- A globally convergent primal-dual interior point algorithm for convex programming
- An Interior-Point Algorithm for Linearly Constrained Optimization
- Sparse quadratic programming in chemical process optimization
Cited In (17)
- A potential-reduction algorithm for linear complementarity problems
- Title not available (Why is that?)
- An active-set strategy in an interior point method for linear programming
- Potential reduction method for harmonically convex programming
- A potential reduction algorithm for monotone variational inequality problems
- Title not available (Why is that?)
- On convex optimization with linear constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- A globally convergent primal-dual interior point algorithm for convex programming
- A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
- Robust reduction of a class of large-scale linear programs
- On lower bound updates in primal potential reduction methods for linear programming
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- 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
- A new potential reduction algorithm for smooth convex programming
This page was built for publication: A potential reduction algorithm for linearly constrained convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953365)
