Sequential convexification in reverse convex and disjunctive programming
From MaRDI portal
Recommendations
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Disjunctive programming: Properties of the convex hull of feasible points
- Convex programs with several additional reverse convex constraints
- Methods for solving some classes of reverse convex programs
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
Cites work
- A Cutting-Plane Game for Facial Disjunctive Programs
- Convex Analysis
- Disjunctive Programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Extensions of a theorem of Balas
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
- Iterative Solution of Nonlinear Optimal Control Problems
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- On the facial structure of scheduling polyhedra
- Reverse convex programming
Cited in
(14)- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Stability in disjunctive optimization II:continuity of the feasible and optimal set
- Stability in disjunctive linear optimization I: continuity of the feasible set
- Sequential characterization of solutions in convex composite programming and applications to vector optimization
- Lift-and-project for mixed 0-1 programming: recent progress
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- A hierarchy of relaxations for linear generalized disjunctive programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Projection, lifting and extended formulation integer and combinatorial optimization
- Solving linear optimization over arithmetic constraint formula
- D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
- A sequential convex program approach to an inverse linear semidefinite programming problem
- Strengthening the sequential convex MINLP technique by perspective reformulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
This page was built for publication: Sequential convexification in reverse convex and disjunctive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825137)
