Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
From MaRDI portal
Publication:3192097
DOI10.1137/120878963zbMath1334.90130arXiv1112.3290OpenAlexW2130216784MaRDI QIDQ3192097
Alexander Michalka, Bienstock, Daniel
Publication date: 26 September 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.3290
Related Items (31)
On the complexity of quadratic programming with two quadratic constraints ⋮ Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ On sublinear inequalities for mixed integer conic programs ⋮ Exactness conditions for an SDP relaxation of the extended trust region problem ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ Two-term disjunctions on the second-order cone ⋮ (Global) optimization: historical notes and recent developments ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Coderivatives related to parametric extended trust region subproblem and their applications ⋮ 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 ⋮ Mixed integer programming with a class of nonlinear convex constraints ⋮ A Note on Polynomial Solvability of the CDT Problem ⋮ Split cuts and extended formulations for mixed integer conic quadratic programming ⋮ Disjunctive cuts for cross-sections of the second-order cone ⋮ A Two-Variable Approach to the Two-Trust-Region Subproblem ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization ⋮ A gentle, geometric introduction to copositive optimization ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem ⋮ Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
This page was built for publication: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
