Pages that link to "Item:Q2934480"
From MaRDI portal
The following pages link to Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set (Q2934480):
Displaying 30 items.
- A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
- Equality-constrained minimization of polynomial functions (Q892787) (← links)
- Probabilistic algorithm for finding roots of linearized polynomials (Q1008961) (← links)
- Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Solving the equality-constrained minimization problem of polynomial functions (Q2010089) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Cooperativity, absolute interaction, and algebraic optimization (Q2204875) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- A probabilistic algorithm for computing data-discriminants of likelihood equations (Q2628325) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- Probabilistic algorithm for computing the dimension of real algebraic sets (Q2819735) (← links)
- Optimizing a parametric linear function over a non-compact real algebraic variety (Q2819759) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- COMPUTING LEAST FIXED POINTS OF PROBABILISTIC SYSTEMS OF POLYNOMIALS (Q3113763) (← links)
- A Polynomial Approximation Algorithm for Real-Time Maximum-Likelihood Estimation (Q4569687) (← links)
- On stability and the Łojasiewicz exponent at infinity of coercive polynomials (Q5206513) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- Coercive Polynomials and Their Newton Polytopes (Q5502243) (← links)
- Tensor Manifold with Tucker Rank Constraints (Q5865922) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- The distance to cubic symmetry class as a polynomial optimization problem (Q6608102) (← links)
