scientific article
From MaRDI portal
Publication:3076648
zbMath1247.90211MaRDI QIDQ3076648
Publication date: 23 February 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semidefinite programmingpolynomial complexityinexact search directioninfeasible central path, infeasible interior point methodsemidefinite least squares
Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10)
Related Items (5)
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
Uses Software
This page was built for publication:
