Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
From MaRDI portal
Publication:2934480
DOI10.1137/130931308zbMath1327.90232arXiv1307.8281OpenAlexW2063194632MaRDI QIDQ2934480
Aurélien Greuet, Mohab Safey El Din
Publication date: 12 December 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.8281
Symbolic computation and algebraic computation (68W30) Nonconvex programming, global optimization (90C26) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items (22)
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ A probabilistic algorithm for computing data-discriminants of likelihood equations ⋮ Positivity certificates and polynomial optimization on non-compact semialgebraic sets ⋮ Real root finding for low rank linear matrices ⋮ Solving rank-constrained semidefinite programs in exact arithmetic ⋮ Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics ⋮ Equality-constrained minimization of polynomial functions ⋮ Refined F5 Algorithms for Ideals of Minors of Square Matrices ⋮ Cooperativity, absolute interaction, and algebraic optimization ⋮ On the complexity of testing attainment of the optimal value in nonlinear optimization ⋮ Global optimization of polynomials over real algebraic sets ⋮ Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials ⋮ Solving determinantal systems using homotopy techniques ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ Intrinsic complexity estimates in polynomial optimization ⋮ Solving the equality-constrained minimization problem of polynomial functions ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ On stability and the Łojasiewicz exponent at infinity of coercive polynomials ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Coercive Polynomials and Their Newton Polytopes ⋮ Computing critical points for invariant algebraic systems ⋮ Tensor Manifold with Tucker Rank Constraints
Uses Software
This page was built for publication: Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
