Pages that link to "Item:Q2574101"

The following pages link to A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101):

Displaying 36 items.

• A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics (Q285928) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Convergence analysis of Taylor models and McCormick-Taylor models (Q367158) (← links)
• A reformulation framework for global optimization (Q367160) (← 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)
• Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
• Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
• Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
• Convex underestimation for posynomial functions of positive variables (Q941023) (← links)
• A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
• Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
• Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions (Q1024827) (← links)
• Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions (Q1024828) (← links)
• Petroleum refinery optimization (Q1642991) (← links)
• Canonical duality for box constrained nonconvex and nonsmooth optimization problems (Q1665441) (← 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)
• Chebyshev model arithmetic for factorable functions (Q1675562) (← 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)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• Convex underestimators of polynomials (Q1955542) (← links)
• On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method (Q2018467) (← links)
• Multivariate McCormick relaxations (Q2250101) (← links)
• On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
• Tighter \(\alpha \mathrm{BB}\) relaxations through a refinement scheme for the scaled Gerschgorin theorem (Q2416572) (← links)
• On the functional form of convex underestimators for twice continuously differentiable functions (Q2458918) (← links)
• Convex relaxation for solving posynomial programs (Q2655346) (← links)
• Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm (Q4924117) (← links)
• Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
• An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices (Q5964239) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)