A new primal-dual polynomial algorithm for convex quadratic programming
From MaRDI portal
Recommendations
- A new primal-dual path-following method for convex quadratic programming
- A new primal-dual path-following algorithm for convex quadratic semidefinite programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity
- Short-step primal-dual target-following algorithms for the convex quadratic problems
Cited in
(10)- An exterior point polynomial-time algorithm for convex quadratic programming
- Short-step primal-dual target-following algorithms for the convex quadratic problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
- A Polynomial Method of Weighted Centers for Convex Quadratic Programming
- scientific article; zbMATH DE number 4193461 (Why is no real title available?)
- A new primal-dual path-following method for convex quadratic programming
- Primal-dual method of solving convex quadratic programming problems
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
This page was built for publication: A new primal-dual polynomial algorithm for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2858217)
