Convex programming for disjunctive convex optimization

Cited In (88)

Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
Polyhedral approximation in mixed-integer convex optimization
Approximated perspective relaxations: a project and lift approach
A convex-analysis perspective on disjunctive cuts
Perspective Reformulations of the CTA Problem with L₂ Distances
On optimality and duality theorems of nonlinear disjunctive fractional minmax programs
Lift-and-project cuts for convex mixed integer nonlinear programs
Quadratic optimization with switching variables: the convex hull for \(n=2\)
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
On quantile cuts and their closure for chance constrained optimization problems
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
Computational approaches for mixed integer optimal control problems with indicator constraints
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
On handling indicator constraints in mixed integer programming
Convex envelopes generated from finitely many compact convex sets
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
Explicit convex and concave envelopes through polyhedral subdivisions
Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
Strong formulations for conic quadratic optimization with indicator variables
Disjunctive Cuts for Nonconvex MINLP
Perspective functions: properties, constructions, and examples
Lift-and-project for mixed 0-1 programming: recent progress
A disjunctive cut strengthening technique for convex MINLP
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Lift-and-Project Cuts for Mixed Integer Convex Programs
Quadratic cone cutting surfaces for quadratic programs with on-off constraints
How to convexify the intersection of a second order cone and a nonconvex quadratic
Optimality conditions for disjunctive optimization in reflexive Banach spaces
A hierarchy of relaxations for linear generalized disjunctive programming
A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Demand allocation with latency cost functions
A perspective-based convex relaxation for switched-affine optimal control
Disjunctive cuts in mixed-integer conic optimization
Perspective cuts for a class of convex 0-1 mixed integer programs
On interval-subgradient and no-good cuts
Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
Disjunctive optimization: Critical point theory
Projection, lifting and extended formulation integer and combinatorial optimization
Solving linear optimization over arithmetic constraint formula
A geometric approach to cut-generating functions
Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
Perspective Reformulation and Applications
On the optimality of nonlinear fractional disjunctive programming problems
Convexity of the proximal average
Ideal formulations for constrained convex optimization problems with indicator variables
Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Mixed-integer nonlinear programs featuring ``on/off constraints
Strong formulations for quadratic optimization with M-matrices and indicator variables
Scalable Algorithms for the Sparse Ridge Regression
A modified lift-and-project procedure
Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
A Scalable Algorithm for Sparse Portfolio Selection
Split cuts for robust mixed-integer optimization
New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
Extended formulations in mixed integer conic quadratic programming
Global optimization of generalized semi-infinite programs using disjunctive programming
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization
Mixed-Integer Convex Representability
Submodularity in Conic Quadratic Mixed 0–1 Optimization
Constructive Discrepancy Minimization for Convex Sets
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
Between steps: intermediate relaxations between big-M and convex hull formulations
Small and strong formulations for unions of convex sets from the Cayley embedding
Comparison of MINLP formulations for global superstructure optimization
Bi-perspective functions for mixed-integer fractional programs with indicator variables
A graph-based decomposition method for convex quadratic optimization with indicators
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
Ideal, non-extended formulations for disjunctive constraints admitting a network representation
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
A computational study of perspective cuts
Adjustable robust optimization with objective uncertainty
Shortest Paths in Graphs of Convex Sets
Subset Selection and the Cone of Factor-Width-k Matrices
Constrained optimization of rank-one functions with indicator variables
Supermodularity and valid inequalities for quadratic optimization with indicators
A new perspective on low-rank optimization
Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
Mathematical programming formulations for piecewise polynomial functions
On the convex hull of convex quadratic optimization problems with indicators
Shapes and recession cones in mixed-integer convex representability

   Recommendations

Two methods for minimizing convex functions in a class of nonconvex sets 👍 👎
Title not available (Why is that?) 👍 👎
A Decomposition Method and Its Application to Convex Programming 👍 👎
Convergence of a numerical abstract convexity algorithm 👍 👎
An approach to solving convex programs with nonsmooth objectives 👍 👎

This page was built for publication: Convex programming for disjunctive convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970366)