Second-order sufficient optimality conditions for local and global nonlinear programming

DOI10.1007/BF00121660zbMath0868.90112MaRDI QIDQ2564610

Arnold Neumaier

Publication date: 18 August 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

interval analysisbranch-and-boundconvexity testglobal optimality of a Kuhn-Tucker pointsufficient conditions of nonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items

EAGO.jl: easy advanced global optimization in Julia ⋮ Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems ⋮ Linear systems with large uncertainties, with applications to truss structures ⋮ Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming ⋮ New Kuhn-Tucker sufficiency for global optimality via convexification ⋮ A global optimization method, QBB, for twice-differentiable nonconvex optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• Checking local optimality in constrained quadratic programming is NP- hard
• An optimality criterion for global quadratic optimization
• Introduction to global optimization
• Interval Methods for Systems of Equations