Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
DOI10.1007/S10898-016-0443-3zbMATH Open1370.90153OpenAlexW2405834241MaRDI QIDQ522270FDOQ522270
Authors: Christoph Buchheim, Claudia D'Ambrosio 
Publication date: 28 April 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0443-3
Recommendations
- Box-constrained mixed-integer polynomial optimization using separable underestimators
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Convex underestimators of polynomials
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- New underestimator for univariate global optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)
Cites Work
- SCIP: solving constraint integer programs
- Mixed-integer nonlinear optimization
- A polyhedral branch-and-cut approach to global optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Class of global minimum bounds of polynomial functions
- Title not available (Why is that?)
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Title not available (Why is that?)
- Branching and bounds tighteningtechniques for non-convex MINLP
- Extending the QCR method to general mixed-integer programs
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Mixed integer nonlinear programming tools: an updated practical overview
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Convex underestimators of polynomials
- Box-constrained mixed-integer polynomial optimization using separable underestimators
- Mixed integer nonlinear programming tools: a practical overview
Cited In (7)
- The convex hull of a quadratic constraint over a polytope
- Box-constrained mixed-integer polynomial optimization using separable underestimators
- Efficient linear reformulations for binary polynomial optimization problems
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Error bounds for monomial convexification in polynomial optimization
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Norm bounds and underestimators for unconstrained polynomial integer minimization
Uses Software
This page was built for publication: Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522270)
