Pages that link to "Item:Q1424271"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for semialgebraic problems (Q1424271):
Displaying 50 items.
- Equilibrium-independent passivity: a new definition and numerical certification (Q644256) (← links)
- Tunable halfband-pair wavelet filter banks and application to multifocus image fusion (Q645899) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Discriminants and nonnegative polynomials (Q655567) (← links)
- Positive semidefinite diagonal minus tail forms are sums of squares (Q658336) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
- Analysis of autocatalytic networks in biology (Q665134) (← links)
- Robust stability and instability of biochemical networks with parametric uncertainty (Q665136) (← links)
- Cross-Hill: a heuristic method for global optimization (Q669439) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces (Q693193) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares (Q816068) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- SOS approximations of nonnegative polynomials via simple high degree perturbations (Q883108) (← links)
- Integral quadratic constraints for delayed nonlinear and parameter-varying systems (Q888999) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Set-membership estimation of fiber laser physical parameters from input-output power measurements (Q900678) (← links)
- On the performance of nonlinear dynamical systems under parameter perturbation (Q901209) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Algorithms for multidimensional spectral factorization and sum of squares (Q935383) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- Positive polynomials and semidefinite programming (Q948606) (← links)
- Polynomial designs. I: Polynomial characterizations of common properties of a design (Q957562) (← links)
- MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
- A revision of the proof of the Kepler conjecture (Q977177) (← links)
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- A semidefinite programming approach to the generalized problem of moments (Q995783) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
- Local stability analysis using simulations and sum-of-squares programming (Q1004144) (← links)
- Numerical approaches for collaborative data processing (Q1027146) (← links)
- An algorithm for the global optimization of a class of continuous minimax problems (Q1028590) (← links)
- A semi-algebraic approach for asymptotic stability analysis (Q1036644) (← links)
- Computing differential invariants of hybrid systems as fixed points (Q1039853) (← links)
