Pages that link to "Item:Q2826815"
From MaRDI portal
The following pages link to Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815):
Displaying 13 items.
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
