A new technique to derive tight convex underestimators (sometimes envelopes)
From MaRDI portal
Publication:6155069
Recommendations
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Convex extensions and envelopes of lower semi-continuous functions
- The Convex Envelope of (n–1)-Convex Functions
- Exact and approximate results for convex envelopes of special structured functions over simplices
- A technique to derive the analytical form of convex envelopes for some bivariate functions
Cites work
- A convex envelope formula for multilinear functions
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Computing uniform convex approximations for convex envelopes and convex hulls
- Convergence rate of McCormick relaxations
- Convex and concave envelopes: revisited and new perspectives
- Convex envelopes for edge-concave functions
- Convex envelopes generated from finitely many compact convex sets
- Convex envelopes of bivariate functions through the solution of KKT systems
- Convex envelopes of products of convex and component-wise concave functions
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Convex underestimators of polynomials
- Deriving convex hulls through lifting and projection
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Generalized McCormick relaxations
- Global minimum potential energy conformations of small molecules
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Non polyhedral convex envelopes for 1-convex functions
- Semidefinite representation of convex sets
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- The Convex Envelope of (n–1)-Convex Functions
- The generalized trust region subproblem: solution complexity and convex hull results
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- \(NP\)-hardness of linear multiplicative programming and related problems
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)
