Pages that link to "Item:Q1970366"

The following pages link to Convex programming for disjunctive convex optimization (Q1970366):

Displaying 50 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
• Split cuts for robust mixed-integer optimization (Q439905) (← links)
• Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• Convexity of the proximal average (Q630022) (← links)
• Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
• Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• On optimality and duality theorems of nonlinear disjunctive fractional minmax programs (Q872111) (← links)
• A perspective-based convex relaxation for switched-affine optimal control (Q893481) (← links)
• A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming (Q949520) (← links)
• A modified lift-and-project procedure (Q1365045) (← links)
• Disjunctive optimization: Critical point theory (Q1379955) (← links)
• Computational approaches for mixed integer optimal control problems with indicator constraints (Q1633792) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• Perspective functions: properties, constructions, and examples (Q1653321) (← links)
• Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
• Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
• Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
• On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
• Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
• Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
• Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← links)
• Optimality conditions for disjunctive optimization in reflexive Banach spaces (Q2260683) (← links)
• Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
• A geometric approach to cut-generating functions (Q2349120) (← links)
• On handling indicator constraints in mixed integer programming (Q2374361) (← links)
• Demand allocation with latency cost functions (Q2429466) (← links)
• Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
• A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)