Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
DOI10.1080/10556788.2020.1827256zbMath1501.90063arXiv1911.02188OpenAlexW3089683005MaRDI QIDQ5038440
No author found.
Publication date: 30 September 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.02188
semidefinite programmingsecond-order cone programmingchordal sparsityquadratic constrained quadratic programmingaggregate sparsity
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Positive definite completions of partial Hermitian matrices
- Projection, lifting and extended formulation integer and combinatorial optimization
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- Recent advances in the solution of quadratic assignment problems
- Second-order cone programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- An efficient second-order cone programming approach for optimal selection in tree breeding
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- Alternative SDP and SOCP approximations for polynomial optimization
- Conic relaxation approaches for equal deployment problems
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Fast implementation for semidefinite programs with positive matrix completion
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection
- Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding
- Maxima for Graphs and a New Proof of a Theorem of Turán
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
This page was built for publication: Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
