A computational study of perspective cuts
DOI10.1007/s12532-023-00246-4zbMath1528.90003arXiv2103.09573OpenAlexW3139378704MaRDI QIDQ6062884
Stefan Vigerske, Ambros M. Gleixner, Ksenia Bestuzheva
Publication date: 2 December 2023
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.09573
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Experimental work for problems pertaining to operations research and mathematical programming (90-05)
Cites Work
- Unnamed Item
- Approximated perspective relaxations: a project and lift approach
- Mixed-integer nonlinear programs featuring ``on/off constraints
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Convex extensions and envelopes of lower semi-continuous functions
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Alternating current optimal power flow with generator selection
- Improving the approximated projected perspective reformulation by dual information
- Convex envelopes generated from finitely many compact convex sets
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Strong formulations for conic quadratic optimization with indicator variables
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- QPLIB: a library of quadratic programming instances
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Projected Perspective Reformulations with Applications in Design Problems
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Perspective Reformulation and Applications
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- The Cutting-Plane Method for Solving Convex Programs
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- The reformulation of two mixed integer programming problems
- Disjunctive Programming
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
- Benchmarking optimization software with performance profiles.
