Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables

DOI10.1007/s10957-011-9961-9zbMath1274.90399OpenAlexW1985638169MaRDI QIDQ430937

Jing Quan, Jing Tian, Guoquan Li, Zhi-You Wu

Publication date: 26 June 2012

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9961-9

zbMATH Keywords

cubic polynomial optimization problemglobal optimization methodslocal optimization methodsnecessary global optimality conditionsnecessary local optimality conditions

Mathematics Subject Classification ID

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

Related Items

Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Existence and sensitivity analysis for nonconvex cubic optimization problems ⋮ Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials ⋮ Global optimality conditions and optimization methods for polynomial programming problems ⋮ Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables

Cites Work

• Unnamed Item
• A new local and global optimization method for mixed integer quadratic programming problems
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Global optimality conditions for cubic minimization problem with box or binary constraints
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Global Optimization with Polynomials and the Problem of Moments
• A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
• Global optimality conditions for mixed nonconvex quadratic programs†
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• A specialization of the convex simplex method to cubic programming
• Quasi-concavity and pseudo-concavity of cubic functions
• A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
• An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
• Indefinite cubic programming with standard errors in objective function

This page was built for publication: Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables