Pages that link to "Item:Q1424271"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for semialgebraic problems (Q1424271):
Displaying 50 items.
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Continuous-variable nonlocality and contextuality (Q2124212) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Semidefinite programming hierarchies for constrained bilinear optimization (Q2149569) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- An approximate characterisation of the set of feasible trajectories for constrained flat systems (Q2165988) (← links)
- Local stability analysis for large polynomial spline systems (Q2173954) (← links)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Cooperativity, absolute interaction, and algebraic optimization (Q2204875) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- Guaranteed cost \(H_\infty \) controller synthesis for switched systems defined on semi-algebraic sets (Q2252978) (← links)
- Incremental \(\mathcal{L}_2\)-gain stability of piecewise-affine systems with piecewise-polynomial storage functions (Q2280829) (← links)
- Region of attraction analysis with integral quadratic constraints (Q2280938) (← links)
- Lyapunov based estimation of the basin of attraction of Poincaré maps with applications to limit cycle walking (Q2283236) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem (Q2301011) (← links)
- NIL: learning nonlinear interpolants (Q2305413) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- Modeling and estimation of thermal flows based on transport and balance equations (Q2308071) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions (Q2351490) (← links)
- Error bounds for polynomial optimization over the hypercube using Putinar type representations (Q2355314) (← links)
- Inverse problems from biomedicine: inference of putative disease mechanisms and robust therapeutic strategies (Q2376849) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- An alternative Kalman-Yakubovich-Popov lemma and some extensions (Q2391340) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- A sums-of-squares extension of policy iterations (Q2406948) (← links)
- Design of continuous twisting algorithm (Q2407176) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
- Optimal control for non-polynomial systems (Q2436813) (← links)
- Discovering polynomial Lyapunov functions for continuous dynamical systems (Q2437283) (← links)
- Transverse contraction criteria for existence, stability, and robustness of a limit cycle (Q2440014) (← links)
- Exact determinations of the maximal output admissible set for a class of nonlinear systems (Q2440630) (← links)
- Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming (Q2440818) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization (Q2457407) (← links)
- An alternative approach for nonlinear optimal control problems based on the method of moments (Q2457954) (← links)
- Feedback control of quantum entanglement in a two-SPIN system (Q2475458) (← links)
- Constructing invariants for hybrid systems (Q2475635) (← links)
- Numerical multilinear algebra and its applications (Q2477577) (← links)
- There are significantly more nonnegative polynomials than sums of squares (Q2480563) (← links)
