Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions

DOI10.1137/S1052623403420857MaRDI QIDQ4652005zbMATH OpenFDO

Authors Liqun Qi, Zhong Wan, Yufei Yang

Publication date 23 February 2005

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

Full work available at URL https://doi.org/10.1137/S1052623403420857

zbMATH Keywords

global optimizationnormal quartic polynomialtensor

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• New approach to global minimization of normal multivariate polynomial based on tensor
• Optimality conditions and optimization methods for quartic polynomial optimization
• Globally minimizing polynomials without evaluating derivatives
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Finding the global optimum of a class of quartic minimization problem

Cited in

(7)

• Optimality conditions and optimization methods for quartic polynomial optimization
• Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
• A generalized multivariable Newton method
• Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
• Inhomogeneous polynomial optimization over a convex set: an approximation approach
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods

This page was built for publication: Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions

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