A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
From MaRDI portal
(Redirected from Publication:833581)
Recommendations
- Perspective reformulation and applications
- Projected perspective reformulations with applications in design problems
- Approximated perspective relaxations: a project and lift approach
- Quadratic convex reformulations for semicontinuous quadratic programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Convex programming for disjunctive convex optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Perspective cuts for a class of convex 0-1 mixed integer programs
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Semidefinite relaxations of fractional programs via novel convexification techniques
Cited in
(31)- Improving the approximated projected perspective reformulation by dual information
- Approximated perspective relaxations: a project and lift approach
- QPLIB: a library of quadratic programming instances
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- A new optimal electricity market bid model solved through perspective cuts
- A unified approach to mixed-integer optimization problems with logical constraints
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Perspective reformulation and applications
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Strong formulations for conic quadratic optimization with indicator variables
- A computational study of perspective cuts
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- On interval-subgradient and no-good cuts
- Projected perspective reformulations with applications in design problems
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A new perspective on low-rank optimization
- Quadratic convex reformulations for semicontinuous quadratic programming
- Ideal formulations for constrained convex optimization problems with indicator variables
- Perspective reformulations of the CTA problem with \(L_2\) distances
- Extended formulations in mixed integer conic quadratic programming
- A Scalable Algorithm for Sparse Portfolio Selection
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
This page was built for publication: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833581)
