Pages that link to "Item:Q2643791"
From MaRDI portal
The following pages link to SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (Q2643791):
Displayed 15 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach (Q742312) (← links)
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems (Q2393069) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- Perspective Reformulation and Applications (Q2897294) (← links)
- Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances (Q2931708) (← links)
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
- A penalty PALM method for sparse portfolio selection problems (Q5268895) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method (Q5743614) (← links)