Pages that link to "Item:Q1024827"
From MaRDI portal
The following pages link to Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827):
Displaying 27 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A new algorithm for box-constrained global optimization (Q639210) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Convex underestimation for posynomial functions of positive variables (Q941023) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems (Q1768613) (← links)
- Trigonometric convex underestimator for the base functions in Fourier space (Q1777592) (← links)
- Rigorous convex underestimators for general twice-differentiable problems (Q1817315) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- Exact and approximate results for convex envelopes of special structured functions over simplices (Q2141722) (← links)
- Sequence of polyhedral relaxations for nonlinear univariate functions (Q2147925) (← links)
- Convex envelope of bivariate cubic functions over rectangular regions (Q2301177) (← links)
- On the functional form of convex underestimators for twice continuously differentiable functions (Q2458918) (← links)
- Convex kernel underestimation of functions with multiple local minima (Q2506188) (← links)
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators (Q2576447) (← links)
- Convex relaxation for solving posynomial programs (Q2655346) (← links)
- Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions (Q2949919) (← links)
- Combination of two underestimators for univariate global optimization (Q4579891) (← links)
