A new potential reduction algorithm for smooth convex programming
From MaRDI portal
Recommendations
- A potential reduction algorithm for linearly constrained convex programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- scientific article; zbMATH DE number 4197744
- 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
Cites work
- A Centered Projective Algorithm for Linear Programming
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Containing and shrinking ellipsoids in the path-following algorithm
- Convex Analysis
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Lagrange Multipliers and Optimality
- Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
Cited in
(4)- A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
- Potential reduction method for harmonically 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 new potential reduction algorithm for smooth convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944415)
