Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
From MaRDI portal
Publication:2826815
DOI10.1137/140960657zbMath1348.90473arXiv1403.5317OpenAlexW1656696920MaRDI QIDQ2826815
Publication date: 11 October 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5317
Semidefinite programming (90C22) Convex programming (90C25) Integer programming (90C10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Partial Lasserre relaxation for sparse Max-Cut ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ A semidefinite programming method for integer convex quadratic minimization ⋮ DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs ⋮ QPLIB: a library of quadratic programming instances ⋮ A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs ⋮ Compact mixed-integer programming formulations in quadratic optimization ⋮ SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Solving a class of semidefinite programs via nonlinear programming
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- On the separation of split inequalities for non-convex quadratic integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Block Coordinate Descent Methods for Semidefinite Programming
- The MILP Road to MIQCP
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Branching and bounds tighteningtechniques for non-convex MINLP
- Graphical Models, Exponential Families, and Variational Inference
- CSDP, A C library for semidefinite programming
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
