A new technique to derive tight convex underestimators (sometimes envelopes)
From MaRDI portal
Publication:6155069
DOI10.1007/s10589-023-00534-8MaRDI QIDQ6155069
Publication date: 16 February 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
quadratic programmingseparable functionsconvex envelopesconvex underestimatorspolynomial programming
Cites Work
- Unnamed Item
- Non polyhedral convex envelopes for 1-convex functions
- Convex envelopes of products of convex and component-wise concave functions
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
- Semidefinite representation of convex sets
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Global minimum potential energy conformations of small molecules
- A convex envelope formula for multilinear functions
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Deriving convex hulls through lifting and projection
- Convex and concave envelopes: revisited and new perspectives
- Convex envelopes of bivariate functions through the solution of KKT systems
- Convex envelopes for edge-concave functions
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Convex underestimators of polynomials
- The generalized trust region subproblem: solution complexity and convex hull results
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- \(NP\)-hardness of linear multiplicative programming and related problems
- 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
- The Convex Envelope of (n–1)-Convex Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
This page was built for publication: A new technique to derive tight convex underestimators (sometimes envelopes)
