Pages that link to "Item:Q2576447"

The following pages link to Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators (Q2576447):

Displaying 21 items.

• Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A reformulation framework for global optimization (Q367160) (← links)
• A new algorithm for box-constrained global optimization (Q639210) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
• A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← 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)
• On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
• A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
• Convex underestimators of polynomials (Q1955542) (← links)
• Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
• New quadratic lower bound for multivariate functions in global optimization (Q2228598) (← links)
• Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem (Q2416572) (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
• Comments on: Algorithms for linear programming with linear complementarity constraints (Q5970622) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
• A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps (Q6173797) (← links)