Computing local minimizers in polynomial optimization under genericity conditions Computing local minimizers in polynomial optimization under genericity conditions

In this paper, we focus on computing local minimizers of a multivariate polynomial optimization problem under certain genericity conditions. Using a technique from computer algebra and the second-order optimality condition, we provide a univariate representation for the set of local minimizers. In p...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 92; no. 4; pp. 909 - 932
Main Authors:	Hieu, Vu Trung, Takeda, Akiko
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2025 Springer Nature B.V
Subjects:	Algebra Algorithms Computation Computer algebra Computer Science Constraints Deep learning Linear programming Machine learning Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Perturbation methods Polynomial matrices Polynomials Real Functions Local minimizer Polynomial optimization Reduced Gröbner basis Radical of an ideal 13P10 90C23 Second-order optimality condition 14P05 Zero-dimensional ideal Symbolic algorithm
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!