An optimality criterion for global quadratic optimization

DOI10.1007/BF00122055zbMath0783.90095MaRDI QIDQ1187846

Arnold Neumaier

Publication date: 23 July 1992

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

zbMATH Keywords

branch-and-boundlower boundglobal minimizerbounded quadratic programstrong local minimizer

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items

Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems, On the implementation of a global optimization method for mixed-variable problems, A branch-and-reduce approach to global optimization, A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem, Constraint aggregation for rigorous global optimization, Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming, Second-order sufficient optimality conditions for local and global nonlinear programming, Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking local optimality in constrained quadratic programming is NP- hard
• Some NP-complete problems in quadratic and nonlinear programming