Pages that link to "Item:Q1825137"
From MaRDI portal
The following pages link to Sequential convexification in reverse convex and disjunctive programming (Q1825137):
Displaying 13 items.
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Sequential characterization of solutions in convex composite programming and applications to vector optimization (Q1008785) (← links)
- D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems (Q1359460) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- A sequential convex program approach to an inverse linear semidefinite programming problem (Q2821091) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)
- Stability in disjunctive linear optimization I: continuity of the feasible set (Q5750733) (← links)
