Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Box-constrained mixed-integer polynomial optimization using separable underestimators
- Branching and bounds tighteningtechniques for non-convex MINLP
- Class of global minimum bounds of polynomial functions
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex underestimators of polynomials
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Extending the QCR method to general mixed-integer programs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Mixed integer nonlinear programming tools: a practical overview
- Mixed integer nonlinear programming tools: an updated practical overview
- Mixed-integer nonlinear optimization
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- SCIP: solving constraint integer programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
Cited in
(7)- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Error bounds for monomial convexification in polynomial optimization
- The convex hull of a quadratic constraint over a polytope
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Box-constrained mixed-integer polynomial optimization using separable underestimators
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Efficient linear reformulations for binary polynomial optimization problems
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)
