Pages that link to "Item:Q3192097"
From MaRDI portal
The following pages link to Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets (Q3192097):
Displaying 39 items.
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
- Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Modified cutting plane method for minimization of a convex function (Q1280984) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
- Coderivatives related to parametric extended trust region subproblem and their applications (Q1990393) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- A note on polynomial solvability of the CDT problem (Q2789609) (← links)
- A two-variable approach to the two-trust-region subproblem (Q2796795) (← links)
- On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
- On the hierarchy of γ-valid cuts in global optimization (Q3518715) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming (Q4229486) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)
- (Q4544122) (← links)
- Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization (Q5010043) (← links)
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
