Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints

DOI10.15960/J.CNKI.ISSN.1007-6093.2015.02.002MaRDI QIDQ3462913zbMATHFDO

Authors Min Ye, L. Zhang, Zhiyou Wu

Publication date 15 January 2016

zbMATH Keywords

global optimization methodnecessary global optimality conditionlinear inequality constraintscubic polynomial optimization problems

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• Global optimality conditions for cubic minimization problems with cubic constraints
• Global optimality conditions and optimization methods for polynomial programming problems
• Global optimality conditions for cubic minimization problem with box or binary constraints
• Global optimality conditions and optimization methods for constrained polynomial programming problems

Cited in

(3)

• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• Global sufficient optimality conditions for a special cubic minimization problem
• Optimality conditions and optimization methods for quartic polynomial optimization

This page was built for publication: Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462913)