A new primal-dual path-following algorithm for convex quadratic semidefinite programming
From MaRDI portal
Recommendations
- A long step primal-dual path-following algorithm for convex quadratic semidefinite programming
- A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A new primal-dual path-following method for convex quadratic programming
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
Cited in
(13)- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A new primal-dual polynomial algorithm for convex quadratic programming
- A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- Primal dual algorithm for quadratic semi-definite programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
- A long step primal-dual path-following algorithm for convex quadratic semidefinite programming
- A new primal-dual path-following method for convex quadratic programming
- scientific article; zbMATH DE number 5232244 (Why is no real title available?)
- scientific article; zbMATH DE number 5239114 (Why is no real title available?)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- An inexact primal-dual path following algorithm for convex quadratic SDP
This page was built for publication: A new primal-dual path-following algorithm for convex quadratic semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3307225)
