Perspective reformulations of mixed integer nonlinear programs with indicator variables
From MaRDI portal
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 Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Perspective cuts for a class of convex 0-1 mixed integer programs
- 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
(76)- An active-set method for second-order conic-constrained quadratic programming
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A route generation algorithm for an optimal fuel routing problem between two single ports
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Minimizing a sum of clipped convex functions
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- A unified approach to mixed-integer optimization problems with logical constraints
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Gaining or losing perspective
- A new framework to relax composite functions in nonlinear programs
- Bi-perspective functions for mixed-integer fractional programs with indicator variables
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Computational approaches for mixed integer optimal control problems with indicator constraints
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Grouped variable selection with discrete optimization: computational and statistical perspectives
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A graph-based decomposition method for convex quadratic optimization with indicators
- scientific article; zbMATH DE number 7370569 (Why is no real title available?)
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Perspective reformulation and applications
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- On handling indicator constraints in mixed integer programming
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Comparative analysis of several models of the same same mixed-integer nonlinear programing problem
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Strong formulations for conic quadratic optimization with indicator variables
- Integrated aircraft-path assignment and robust schedule design with cruise speed control
- A computational study of perspective cuts
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- On speed scaling via integer programming
- Aircraft rescheduling with cruise speed control
- Shortest Paths in Graphs of Convex Sets
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Subset Selection and the Cone of Factor-Width-k Matrices
- Constrained optimization of rank-one functions with indicator variables
- Tightening methods based on nontrivial bounds on bilinear terms
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- A reformulation-enumeration MINLP algorithm for gas network design
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Supermodularity and valid inequalities for quadratic optimization with indicators
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Locally ideal formulations for piecewise linear functions with indicator variables
- Valid inequalities for separable concave constraints with indicator variables
- scientific article; zbMATH DE number 7733439 (Why is no real title available?)
- A new perspective on low-rank optimization
- On the convexification of constrained quadratic optimization problems with indicator variables
- Quadratic convex reformulations for semicontinuous quadratic programming
- Ideal formulations for constrained convex optimization problems with indicator variables
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- On mathematical programming with indicator constraints
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- Extended formulations in mixed integer conic quadratic programming
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- On the convex hull of convex quadratic optimization problems with indicators
- 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
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)
