Convex underestimators of polynomials
From MaRDI portal
Publication:1955542
DOI10.1007/s10898-012-9974-4zbMath1273.90160OpenAlexW2162156220MaRDI QIDQ1955542
Tung Phan Thanh, Jean-Bernard Lasserre
Publication date: 14 June 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9974-4
Related Items
Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem, A new technique to derive tight convex underestimators (sometimes envelopes), Convex and concave envelopes: revisited and new perspectives, Two new reformulation convexification based hierarchies for 0-1 MIPs, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Performance of convex underestimators in a branch-and-bound framework, A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, Certification of real inequalities: templates and sums of squares
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Handbook of test problems in local and global optimization
- Convex extensions and envelopes of lower semi-continuous functions
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- On convex relaxations of quadrilinear terms
- Deterministic global optimization. Theory, methods and applications
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Global Optimization with Polynomials and the Problem of Moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- The Bounded Convergence Theorem
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
