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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 92; H. 4; S. 909 - 932
Hauptverfasser:	Hieu, Vu Trung, Takeda, Akiko
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2025 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!