Transposition Theorems and Qualification‐Free Optimality Conditions

DOI10.1137/05063129XzbMath1136.90043MaRDI QIDQ5426896

Arnold Neumaier, Hermann Schichl

Publication date: 16 November 2007

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationnecessary and sufficient conditionstheorem of the alternativefirst order optimality conditionssecond order optimality conditionspositivstellensatzFritz John conditionsglobal optimality conditionKuhn-Tucker conditionsMangasarian-Fromovitz constraint qualificationtransposition theoremCertificate of global optimalityKarush-John conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (8)

Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ Necessary global optimality conditions for nonlinear programming problems with polynomial constraints ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ Differential conditions for constrained nonlinear programming via Pareto optimization ⋮ Exclusion regions for optimization problems ⋮ First order rejection tests for multiple-objective optimization ⋮ Constraint aggregation for rigorous global optimization

Uses Software

• GloptiPoly
• INTOPT_90

Cites Work

• INTOPT_90

This page was built for publication: Transposition Theorems and Qualification‐Free Optimality Conditions