Pages that link to "Item:Q2834563"
From MaRDI portal
The following pages link to Exact algorithms for linear matrix inequalities (Q2834563):
Displaying 27 items.
- Auxetic deformations and elliptic curves (Q1647847) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- An SOS counterexample to an inequality of symmetric functions (Q2022461) (← links)
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes (Q2022606) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Real root finding for low rank linear matrices (Q2175227) (← links)
- Exact algorithms for semidefinite programs with degenerate feasible set (Q2229751) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- Solving Rank-Constrained Semidefinite Programs in Exact Arithmetic (Q2985848) (← links)
- On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities (Q3295879) (← links)
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality (Q4327426) (← links)
- Symbolic computation in hyperbolic programming (Q4561483) (← links)
- Gram spectrahedra (Q4635359) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- Numerical Sensitivity of Linear Matrix Inequalities Using Shift and Delta Operators (Q5353010) (← links)
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate (Q5864697) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Convex computation of maximal Lyapunov exponents (Q6048912) (← links)
- Automated tight Lyapunov analysis for first-order methods (Q6665382) (← links)
