Perspective cuts for a class of convex 0-1 mixed integer programs

DOI10.1007/s10107-005-0594-3zbMath1134.90447OpenAlexW2170569252WikidataQ118165502 ScholiaQ118165502MaRDI QIDQ2490334

Publication date: 2 May 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0594-3

zbMATH Keywords

Mixed-Integer Programs Portfolio Optimization Unit Commitment problem Valid Inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

Minotaur: a mixed-integer nonlinear optimization toolkit, Gaining or losing perspective, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, A disjunctive cut strengthening technique for convex MINLP, Inversion of convection-diffusion equation with discrete sources, 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, Perspective Reformulation and Applications, Disjunctive Cuts for Nonconvex MINLP, Computational approaches for mixed integer optimal control problems with indicator constraints, Global optimization for sparse solution of least squares problems, An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Strong formulations for quadratic optimization with M-matrices and indicator variables, SDP diagonalizations and perspective cuts for a class of nonseparable MIQP, Delay-constrained routing problems: accurate scheduling models and admission control, An extended formulation for two-stage stochastic unit commitment with reserves, Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems, A new method for mean-variance portfolio optimization with cardinality constraints, Approximation Bounds for Sparse Programs, A multiplicative weights update algorithm for MINLP, Perspective Reformulations of the CTA Problem with L₂ Distances, A Scalable Algorithm for Sparse Portfolio Selection, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach, Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, On interval-subgradient and no-good cuts, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Grouped variable selection with discrete optimization: computational and statistical perspectives, A new perspective on low-rank optimization, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, Simultaneous feature selection and outlier detection with optimality guarantees, An iterative method for solving a bi-objective constrained portfolio optimization problem, An exact algorithm for a resource allocation problem in mobile wireless communications, Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective, A computational study of perspective cuts, Extended formulations in mixed integer conic quadratic programming, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, Optimization for Power Systems and the Smart Grid, Expected mean return—standard deviation efficient frontier approximation with low‐cardinality portfolios in the presence of the risk‐free asset, Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables, A graph-based decomposition method for convex quadratic optimization with indicators, An efficient compact quadratic convex reformulation for general integer quadratic programs, Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs, On the convex hull of convex quadratic optimization problems with indicators, Unnamed Item, Cardinality constrained portfolio selection problem: a completely positive programming approach, Deep Neural Networks Pruning via the Structured Perspective Regularization, Convex envelopes generated from finitely many compact convex sets, Solution to dynamic economic dispatch with prohibited operating zones via MILP, Supermodularity and valid inequalities for quadratic optimization with indicators, Lift-and-project cuts for convex mixed integer nonlinear programs, Demand allocation with latency cost functions, Shortest Paths in Graphs of Convex Sets, Subset Selection and the Cone of Factor-Width-k Matrices, An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs, A new optimal electricity market bid model solved through perspective cuts, Mixed-integer nonlinear programs featuring ``on/off constraints, Improving the approximated projected perspective reformulation by dual information, Large-scale unit commitment under uncertainty: an updated literature survey, Extending the QCR method to general mixed-integer programs, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, Scalable Algorithms for the Sparse Ridge Regression, Valid inequalities for quadratic optimisation with domain constraints, Bi-perspective functions for mixed-integer fractional programs with indicator variables, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, Regularized optimization methods for convex MINLP problems, A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation, Perspective cuts for a class of convex 0-1 mixed integer programs, QPLIB: a library of quadratic programming instances, A fast exact method for the capacitated facility location problem with differentiable convex production costs, Strong formulations for conic quadratic optimization with indicator variables, Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions, Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition, Quadratic optimization with switching variables: the convex hull for \(n=2\), Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems, Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach, Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching, Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints, Strengthening the sequential convex MINLP technique by perspective reformulations, Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, Compact mixed-integer programming formulations in quadratic optimization, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Modified orbital branching for structured symmetry with an application to unit commitment, Sparse regression at scale: branch-and-bound rooted in first-order optimization, Delay-constrained shortest paths: approximation algorithms and second-order cone models, Large-scale unit commitment under uncertainty, A penalty PALM method for sparse portfolio selection problems, Ideal formulations for constrained convex optimization problems with indicator variables, Approximated perspective relaxations: a project and lift approach

Cites Work