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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of global optimization Ročník 92; číslo 4; s. 909 - 932
Hlavní autoři:	Hieu, Vu Trung, Takeda, Akiko
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2025 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!