Convex programming for disjunctive convex optimization
From MaRDI portal
Publication:1970366
Recommendations
- Two methods for minimizing convex functions in a class of nonconvex sets
- scientific article; zbMATH DE number 3910151
- 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
Cited in
(91)- Approximated perspective relaxations: a project and lift approach
- Polyhedral approximation in mixed-integer convex optimization
- Constructive Discrepancy Minimization for Convex Sets
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- A convex-analysis perspective on disjunctive cuts
- Cutting plane algorithm for convex generalized disjunctive programs
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Between steps: intermediate relaxations between big-M and convex hull formulations
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Lift-and-project cuts for mixed integer convex programs
- On quantile cuts and their closure for chance constrained optimization problems
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Bi-perspective functions for mixed-integer fractional programs with indicator variables
- Scalable algorithms for the sparse ridge regression
- Comparison of MINLP formulations for global superstructure optimization
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Computational approaches for mixed integer optimal control problems with indicator constraints
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- A graph-based decomposition method for convex quadratic optimization with indicators
- 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 finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- 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
- Explicit convex and concave envelopes through polyhedral subdivisions
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Lift-and-project for mixed 0-1 programming: recent progress
- Strong formulations for conic quadratic optimization with indicator variables
- Perspective functions: properties, constructions, and examples
- A disjunctive cut strengthening technique for convex MINLP
- Disjunctive Cuts for Nonconvex MINLP
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- A computational study of perspective cuts
- Adjustable robust optimization with objective uncertainty
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- 50 years of mixed-integer nonlinear and disjunctive programming
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
- 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
- Mixed-integer convex representability
- Shortest Paths in Graphs of Convex Sets
- A perspective-based convex relaxation for switched-affine optimal control
- Demand allocation with latency cost functions
- On interval-subgradient and no-good cuts
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Subset Selection and the Cone of Factor-Width-k Matrices
- Disjunctive cuts in mixed-integer conic optimization
- Constrained optimization of rank-one functions with indicator variables
- Disjunctive optimization: Critical point theory
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- 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
- Supermodularity and valid inequalities for quadratic optimization with indicators
- A new perspective on low-rank optimization
- On the optimality of nonlinear fractional disjunctive programming problems
- On the convexification of constrained quadratic optimization problems with indicator variables
- Convexity of the proximal average
- 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
- Mathematical programming formulations for piecewise polynomial functions
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Limiting normal cones to the union of two convex sets and M-stationarity: local uniqueness and stability in mathematical programming
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- A modified lift-and-project procedure
- Split cuts for robust mixed-integer optimization
- Perspective reformulations of the CTA problem with L₂ distances
- Extended formulations in mixed integer conic quadratic programming
- A Scalable Algorithm for Sparse Portfolio Selection
- Global optimization of generalized semi-infinite programs using disjunctive programming
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- On the convex hull of convex quadratic optimization problems with indicators
- Shapes and recession cones in mixed-integer convex representability
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)
