A computational study of perspective cuts
Open Access
- 21 August 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 15 (4) , 703-731
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Zuse-Institut Berlin
This publication has 36 references indexed in Scilit:
- Convex envelopes generated from finitely many compact convex setsMathematical Programming, 2011
- Mixed-integer nonlinear programs featuring “on/off” constraintsComputational Optimization and Applications, 2011
- Strong valid inequalities for orthogonal disjunctions and bilinear covering setsMathematical Programming, 2010
- Perspective reformulations of mixed integer nonlinear programs with indicator variablesMathematical Programming, 2010
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planesOperations Research Letters, 2009
- Perspective cuts for a class of convex 0–1 mixed integer programsMathematical Programming, 2005
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Convex programming for disjunctive convex optimizationMathematical Programming, 1999
- A branch-and-cut method for 0-1 mixed convex programmingMathematical Programming, 1999