Approximated perspective relaxations: a project and lift approach
From MaRDI portal
Publication:263157
DOI10.1007/s10589-015-9787-8zbMath1362.90301OpenAlexW1670218960WikidataQ57659028 ScholiaQ57659028MaRDI QIDQ263157
Claudio Gentile, Antonio Frangioni, Fabio Furini
Publication date: 4 April 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/753555
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11)
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems, Perspective Reformulations of the CTA Problem with L2 Distances, A Scalable Algorithm for Sparse Portfolio Selection, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, A computational study of perspective cuts, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs, Deep Neural Networks Pruning via the Structured Perspective Regularization, A polynomial-time algorithm with tight error bounds for single-period unit commitment problem, Improving the approximated projected perspective reformulation by dual information, Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, QPLIB: a library of quadratic programming instances, Strong formulations for conic quadratic optimization with indicator variables, Strengthening the sequential convex MINLP technique by perspective reformulations, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Relaxation schemes for mathematical programmes with switching constraints, Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Mixed-integer bilinear programming problems
- 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
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Convex extensions and envelopes of lower semi-continuous functions
- A polyhedral branch-and-cut approach to global optimization
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Large-scale unit commitment under uncertainty
- A library for continuous convex separable quadratic knapsack problems
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Demand allocation with latency cost functions
- Perspective cuts for a class of convex 0-1 mixed integer programs
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- A bundle-type algorithm for routing in telecommunication data networks
- Projected Perspective Reformulations with Applications in Design Problems
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Perspective Reformulation and Applications
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
