Optimality conditions and optimization methods for quartic polynomial optimization

DOI10.1016/J.AMC.2014.01.074MaRDI QIDQ1646197zbMATH OpenOpenAlexFDO

Authors Jing Tian, J. Quan, Julien Ugon, Zhiyou Wu

Publication date 22 June 2018

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2014.01.074

zbMATH Keywords

linear transformationglobal optimization methodlocal optimization methodnecessary global optimality conditionquartic polynomial optimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• Global optimality conditions and optimization methods for polynomial programming problems
• Global optimality conditions and optimization methods for constrained polynomial programming problems
• A sufficient conditions for global quadratic optimization
• Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints
• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables

Cites work

• scientific article; zbMATH DE number 480296 (Why is no real title available?)
• scientific article; zbMATH DE number 1057696 (Why is no real title available?)
• scientific article; zbMATH DE number 1489808 (Why is no real title available?)
• scientific article; zbMATH DE number 757677 (Why is no real title available?)
• A Global Optimization Algorithm for Concave Quadratic Programming Problems
• A finite algorithm for solving general quadratic problems
• A new local and global optimization method for mixed integer quadratic programming problems
• A novel filled function method and quasi-filled function method for global optimization
• A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
• Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints
• Blind constant modulus equalization via convex optimization
• Conditions for global optimality. II
• Derivative constrained optimum broad-band antenna arrays
• Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
• Global optimality conditions for cubic minimization problem with box or binary constraints
• Global optimality conditions for mixed nonconvex quadratic programs†
• Global optimality conditions for quadratic optimization problems with binary constraints
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Multivariate polynomial minimization and its application in signal processing
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• New approach to global minimization of normal multivariate polynomial based on tensor
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Nonlinear Programming
• Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
• Quadratic programming with one negative eigenvalue is NP-hard
• Regularization methods for SDP relaxations in large-scale polynomial optimization
• Second‐Order Cone Programming Relaxation of Sensor Network Localization
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
• Sufficient global optimality conditions for bivalent quadratic optimization
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Sum of squares method for sensor network localization
• Truncated Newton method for sparse unconstrained optimization using automatic differentiation
• Using copositivity for global optimality criteria in concave quadratic programming problems

Cited in

(10)

• Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
• Certifying the global optimality of quartic minimization over the sphere
• Golden Quadruplet: Optimization - Inequality - Identity - Operator
• On the triality theory for a quartic polynomial optimization problem
• An efficient alternating minimization method for fourth degree polynomial optimization
• 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
• On cones of nonnegative quartic forms

Describes a project that uses

Uses Software

• pyuvdata

This page was built for publication: Optimality conditions and optimization methods for quartic polynomial optimization

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