New results on semidefinite bounds forℓ1-constrained nonconvex quadratic optimization
From MaRDI portal
Publication:5397701
Recommendations
- New bounds for nonconvex quadratically constrained quadratic programming
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- New positive semidefinite relaxations for nonconvex quadratic programs
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
Cited in
(6)- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- Cutting plane generation through sparse principal component analysis
This page was built for publication: New results on semidefinite bounds forℓ1-constrained nonconvex quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5397701)