scientific article
From MaRDI portal
Publication:3067612
zbMath1279.90126MaRDI QIDQ3067612
Publication date: 21 January 2011
Full work available at URL: http://gcoe-mi.jp/english/./temp/publish/93ad8b8dc560f1fa590f7bf71494b8da.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semidefinite programmingpolynomial complexitysymmetric cone programminginexact search directioninfeasible interior point method
Related Items (6)
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ A corrector-predictor path-following method for convex quadratic symmetric cone optimization ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
Uses Software
This page was built for publication:
