Computing local minimizers in polynomial optimization under genericity conditions

DOI10.1007/S10898-025-01500-WMaRDI QIDQ6939955zbMATH OpenFDO

Authors Vu Trung Hieu, Akiko Takeda

Publication date 20 August 2025

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10898-025-01500-W

zbMATH Keywords

local minimizerpolynomial optimizationradical of an idealreduced Gröbner basissecond-order optimality conditionsymbolic algorithmzero-dimensional ideal

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Real algebraic sets (14P05) Polynomial optimization (90C23)

Cites work

• A Geometric Buchberger Algorithm for Integer Programming
• A new algebraic geometry algorithm for integer programming
• A NOTE ON THE SQUARED SLACK VARIABLES TECHNIQUE FOR NONLINEAR OPTIMIZATION
• A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
• Algebraic degree of polynomial optimization
• Algorithms in real algebraic geometry
• Checking local optimality in constrained quadratic programming is NP- hard
• Computing global minima to polynomial optimization problems using Gröbner bases
• Computing the global optimum of a multivariate polynomial over the reals
• CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
• Generic properties for semialgebraic programs
• Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
• Global optimization with polynomials and the problem of moments
• scientific article; zbMATH DE number 4132308 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 177867 (Why is no real title available?)
• scientific article; zbMATH DE number 1984325 (Why is no real title available?)
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• Local minimizers of semi-algebraic functions from the viewpoint of tangencies
• Minimizing polynomials via sum of squares over the gradient ideal
• New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
• On the complexity of finding a local minimizer of a quadratic function over a polytope
• On the stability of solutions to quadratic programming problems
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• Semidefinite programming relaxations for semialgebraic problems
• Solving zero-dimensional systems through the rational univariate representation
• Some algebraic methods for solving multiobjective polynomial integer programs
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Sums of squares, moment matrices and optimization over polynomials
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Testing Unconstrained Optimization Software
• The hierarchy of local minimums in polynomial optimization

Cited in

(1)

• Univariate representations of solutions to generic polynomial complementarity problems

This page was built for publication: Computing local minimizers in polynomial optimization under genericity conditions

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