Optimality conditions and optimization methods for quartic polynomial optimization
From MaRDI portal
Publication:1646197
DOI10.1016/j.amc.2014.01.074zbMath1410.90237OpenAlexW2006348899MaRDI QIDQ1646197
Julien Ugon, Jing Tian, Jing Quan, Zhi-You 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
linear transformationglobal optimization methodlocal optimization methodnecessary global optimality conditionquartic polynomial optimization problem
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials, Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials, Global optimality conditions and optimization methods for polynomial programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- A new local and global optimization method for mixed integer quadratic programming problems
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Sufficient global optimality conditions for bivalent quadratic optimization
- Sum of squares method for sensor network localization
- A novel filled function method and quasi-filled function method for global optimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- New approach to global minimization of normal multivariate polynomial based on tensor
- Truncated Newton method for sparse unconstrained optimization using automatic differentiation
- Quadratic programming with one negative eigenvalue is NP-hard
- Conditions for global optimality. II
- A finite algorithm for solving general quadratic problems
- Using copositivity for global optimality criteria in concave quadratic programming problems
- Multivariate polynomial minimization and its application in signal processing
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints
- NP-hardness of deciding convexity of quartic polynomials and related problems
- 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
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Global optimality conditions for mixed nonconvex quadratic programs†
- Derivative constrained optimum broad-band antenna arrays
- A Global Optimization Algorithm for Concave Quadratic Programming Problems
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
- Blind constant modulus equalization via convex optimization
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Nonlinear Programming
