Convex programming for disjunctive convex optimization
From MaRDI portal
Publication:1970366
DOI10.1007/s101070050106zbMath0954.90049OpenAlexW2093022060MaRDI QIDQ1970366
Publication date: 22 June 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050106
Related Items (81)
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes ⋮ Perspective Reformulation and Applications ⋮ On handling indicator constraints in mixed integer programming ⋮ Computational approaches for mixed integer optimal control problems with indicator constraints ⋮ Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ Perspective reformulations of mixed integer nonlinear programs with indicator variables ⋮ Strong valid inequalities for orthogonal disjunctions and bilinear covering sets ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Cutting Plane Algorithm for Convex Generalized Disjunctive Programs ⋮ Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ Perspective functions: properties, constructions, and examples ⋮ A modified lift-and-project procedure ⋮ Mixed-Integer Convex Representability ⋮ Perspective Reformulations of the CTA Problem with L2 Distances ⋮ On optimality and duality theorems of nonlinear disjunctive fractional minmax programs ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ Solving linear optimization over arithmetic constraint formula ⋮ A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ On interval-subgradient and no-good cuts ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ A new perspective on low-rank optimization ⋮ 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 ⋮ Adjustable robust optimization with objective uncertainty ⋮ A perspective-based convex relaxation for switched-affine optimal control ⋮ Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Shapes and recession cones in mixed-integer convex representability ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ A hierarchy of relaxations for linear generalized disjunctive programming ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Convexity of the proximal average ⋮ Demand allocation with latency cost functions ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Subset Selection and the Cone of Factor-Width-k Matrices ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ A hierarchy of relaxations for nonlinear convex generalized disjunctive programming ⋮ Split cuts for robust mixed-integer optimization ⋮ Mixed-integer nonlinear programs featuring ``on/off constraints ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Scalable Algorithms for the Sparse Ridge Regression ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ Bi-perspective functions for mixed-integer fractional programs with indicator variables ⋮ New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints ⋮ Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming ⋮ Lift-and-Project Cuts for Mixed Integer Convex Programs ⋮ Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques ⋮ A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming ⋮ Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs ⋮ 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 ⋮ Lift-and-project for mixed 0-1 programming: recent progress ⋮ Optimality conditions for disjunctive optimization in reflexive Banach spaces ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables ⋮ Perspective cuts for a class of convex 0-1 mixed integer programs ⋮ Unnamed Item ⋮ A convex-analysis perspective on disjunctive cuts ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ On quantile cuts and their closure for chance constrained optimization problems ⋮ On the optimality of nonlinear fractional disjunctive programming problems ⋮ Quadratic optimization with switching variables: the convex hull for \(n=2\) ⋮ Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization ⋮ A geometric approach to cut-generating functions ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations ⋮ Ideal formulations for constrained convex optimization problems with indicator variables ⋮ Logic-based modeling and solution of nonlinear discrete/continuous optimization problems ⋮ Projection, lifting and extended formulation integer and combinatorial optimization ⋮ Approximated perspective relaxations: a project and lift approach
This page was built for publication: Convex programming for disjunctive convex optimization
