Perspective reformulations of mixed integer nonlinear programs with indicator variables
From MaRDI portal
In this paper the authors study mixed integer nonlinear programs (MINLP) that are driven by a collection of indicator variables where each indicator variable controls a subset of decision variables. Based on this work some concepts that have been applied successfully in the case of mixed integer linear programs (MILP) can be applied for MINLP. In order to apply these ideas, the authors analyse simple sets that form the structures of many practical MINLPs and than the results are extended to more general sets. Finally, the described ideas are applied to three problems: a quadratic uncapacitated facility location problem, a network design problem with nonlinear congestion constraints and a portfolio optimization problem with buy-in thresholds.
Recommendations
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- On handling indicator constraints in mixed integer programming
- Bi-perspective functions for mixed-integer fractional programs with indicator variables
- A note on convex reformulation schemes for mixed integer quadratic programs
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems
- scientific article; zbMATH DE number 1487995
- Mixed integer programming with a class of nonlinear convex constraints
- Mixed integer nonlinear programming using interior-point methods
- Ideal formulations for constrained convex optimization problems with indicator variables
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- An algorithmic framework for convex mixed integer nonlinear programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Capacitated Network Design—Polyhedral Structure and Computation
- Computational study of a family of mixed-integer quadratic programming problems
- Conic mixed-integer rounding cuts
- Convex programming for disjunctive convex optimization
- Cuts for mixed 0-1 conic programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Integer Programming and Pricing
- Introduction to global optimization
- Large-Scale Network Topological Optimization
- Large-Scale Portfolio Optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- 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 Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(92)- Computational approaches for mixed integer optimal control problems with indicator constraints
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Integrated aircraft-path assignment and robust schedule design with cruise speed control
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Extended formulations in mixed integer conic quadratic programming
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- On speed scaling via integer programming
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- Strong formulations for conic quadratic optimization with indicator variables
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Ideal formulations for constrained convex optimization problems with indicator variables
- Gaining or losing perspective
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Tightening methods based on nontrivial bounds on bilinear terms
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Minimizing a sum of clipped convex functions
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- Bi-perspective functions for mixed-integer fractional programs with indicator variables
- A new framework to relax composite functions in nonlinear programs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Small and strong formulations for unions of convex sets from the Cayley embedding
- On mathematical programming with indicator constraints
- On handling indicator constraints in mixed integer programming
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Locally ideal formulations for piecewise linear functions with indicator variables
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Perspective reformulation and applications
- Aircraft rescheduling with cruise speed control
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Comparative analysis of several models of the same same mixed-integer nonlinear programing problem
- Valid inequalities for separable concave constraints with indicator variables
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Outlier detection in time series via mixed-integer conic quadratic optimization
- On the convexification of constrained quadratic optimization problems with indicator variables
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- A unified approach to mixed-integer optimization problems with logical constraints
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Quadratic convex reformulations for semicontinuous quadratic programming
- An active-set method for second-order conic-constrained quadratic programming
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- 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
- A computational study of perspective cuts
- A route generation algorithm for an optimal fuel routing problem between two single ports
- A graph-based decomposition method for convex quadratic optimization with indicators
- On the convex hull of convex quadratic optimization problems with indicators
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- Supermodularity and valid inequalities for quadratic optimization with indicators
- Shortest Paths in Graphs of Convex Sets
- Subset Selection and the Cone of Factor-Width-k Matrices
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Constrained optimization of rank-one functions with indicator variables
- A reformulation-enumeration MINLP algorithm for gas network design
- A fast global algorithm for multi-linearly constrained separable binary quadratic program
- Integrated aircraft and crew recovery with cruise speed control under slot capacity restriction: a benders decomposition method
- Exact continuous relaxations of _0-regularized criteria with non-quadratic data terms
- A Benders and column generation method to integrated aircraft and passenger recovery with cruise speed control under slot capacity restriction
- Discrete level-bundle method for mean-CVaR portfolio optimization with cardinality constraint
- End-to-end, decision-based, cardinality-constrained portfolio optimization
- Rank-one convexification for sparse regression
- Gaining or losing perspective for convex multivariate functions on box domains
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- 50 years of mixed-integer nonlinear and disjunctive programming
- On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
- Sparse PCA: a new scalable estimator based on integer programming
- Optimizing cooperative carrier-vehicle routing with iterative second-order cone programming method
- P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints
- Explicit convex hull description of bivariate quadratic sets with indicator variables
- A parametric approach for solving convex quadratic optimization with indicators over trees
- Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators
- Minotaur: a mixed-integer nonlinear optimization toolkit
This page was built for publication: Perspective reformulations of mixed integer nonlinear programs with indicator variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638370)
