On the stable solution of large scale problems over the doubly nonnegative cone
From MaRDI portal
Publication:403648
DOI10.1007/s10107-013-0687-3zbMath1312.90050OpenAlexW2015840537MaRDI QIDQ403648
Publication date: 29 August 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0687-3
Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Related Items (4)
A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem ⋮ Genericity Results in Linear Conic Programming—A Tour d’Horizon ⋮ A note on strict complementarity for the doubly non-negative cone
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the regularity of second order cone programs and an application to solving large scale problems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Stable sets and polynomials
- Complementarity and nondegeneracy in semidefinite programming
- A nonsmooth version of Newton's method
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- An Augmented Primal-Dual Method for Linear Conic Programs
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Regularization Methods for Semidefinite Programming
- High-accuracy solution of large-scale semidefinite programs
- Semismooth Matrix-Valued Functions
This page was built for publication: On the stable solution of large scale problems over the doubly nonnegative cone