A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
From MaRDI portal
Publication:3076648
zbMATH Open1247.90211MaRDI QIDQ3076648FDOQ3076648
Authors: Lu Li, Kim-Chuan Toh 
Publication date: 23 February 2011
Recommendations
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A new primal-dual path-following algorithm for convex quadratic semidefinite programming
- A long step primal-dual path-following algorithm for convex quadratic semidefinite programming
- A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
semidefinite programmingpolynomial complexityinexact search directioninfeasible central path, infeasible interior point methodsemidefinite least squares
Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22) Iterative numerical methods for linear systems (65F10)
Cited In (13)
- A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A new primal-dual path-following algorithm for convex quadratic semidefinite programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Title not available (Why is that?)
- Primal dual algorithm for quadratic semi-definite programming
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
Uses Software
This page was built for publication: A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076648)
