A new technique to derive tight convex underestimators (sometimes envelopes)

Cites Work

Convex envelopes generated from finitely many compact convex sets
Explicit convex and concave envelopes through polyhedral subdivisions
Hidden conic quadratic representation of some nonconvex quadratic optimization problems
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
NP-hardness of deciding convexity of quartic polynomials and related problems
Global minimum potential energy conformations of small molecules
A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
A convex envelope formula for multilinear functions
\(NP\)-hardness of linear multiplicative programming and related problems
Convex envelopes for edge-concave functions
Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
Non polyhedral convex envelopes for 1-convex functions
The Convex Envelope of (n–1)-Convex Functions
Convex envelopes of products of convex and component-wise concave functions
Existence and sum decomposition of vertex polyhedral convex envelopes
Convergence rate of McCormick relaxations
Generalized McCormick relaxations
Semidefinite representation of convex sets
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Computing uniform convex approximations for convex envelopes and convex hulls
Convex envelopes of bivariate functions through the solution of KKT systems
Convex underestimators of polynomials
A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
Convex and concave envelopes: revisited and new perspectives
Deriving convex hulls through lifting and projection
The generalized trust region subproblem: solution complexity and convex hull results

This page was built for publication: A new technique to derive tight convex underestimators (sometimes envelopes)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155069)