Constant potential primal-dual algorithms: A framework
From MaRDI portal
Recommendations
- Primal-dual target-following algorithms for linear programming
- On the convergence of primal-dual interior-point methods with wide neighborhoods
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- A globally convergent primal-dual interior point algorithm for convex programming
- scientific article; zbMATH DE number 1047677
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4072729 (Why is no real title available?)
- A Centered Projective Algorithm for Linear Programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Convergence behavior of interior-point algorithms
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Superlinear primal-dual affine scaling algorithms for LCP
Cited in
(4)- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- A self-adjusting interior point algorithm for linear complementarity problems
- Potential-reduction methods in mathematical programming
- A new variant of the primal affine scaling algorithm for linear programs
This page was built for publication: Constant potential primal-dual algorithms: A framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340053)
