Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
From MaRDI portal
Publication:4652005
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
(6)- A generalized multivariable Newton method
- Optimality conditions and optimization methods for quartic polynomial optimization
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
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)