Sostools

swMATH891MaRDI QIDQ13635FDOQ13635

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Analysis of Polynomial Systems With Time Delays via the Sum of Squares Decomposition
• Review on computational methods for Lyapunov functions
• SOSTOOLS and Its Control Applications
• The tracial moment problem and trace-optimization of polynomials
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Advances in computational Lyapunov analysis using sum-of-squares programming
• Grid refinement in the construction of Lyapunov functions using radial basis functions
• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
• Robust stability and performance analysis of 2D mixed continuous-discrete-time systems with uncertainty
• Optimization of Polynomials on Compact Semialgebraic Sets
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Convex conditions for robust stabilization of uncertain switched systems with guaranteed minimum and mode-dependent dwell-time
• Convex conditions for robust stability analysis and stabilization of linear aperiodic impulsive and sampled-data systems under dwell-time constraints
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• On the construction of Lyapunov functions with computer assistance
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Computing sum of squares decompositions with rational coefficients
• Analysis of partial stability problems using sum of squares techniques
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
• Polynomial optimization and a Jacobi-Davidson type method for commuting matrices
• Theoretical and numerical comparisons of looped functionals and clock-dependent Lyapunov functions -- The case of periodic and pseudo-periodic systems with impulses
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• A convex polynomial that is not sos-convex
• A Sum of Squares Approximation of Nonnegative Polynomials
• Revisiting two theorems of Curto and Fialkow on moment matrices
• Distance optimization and the extremal variety of the Grassmann variety
• On the complexity of Putinar's Positivstellensatz
• Complete search in continuous global optimization and constraint satisfaction
• Approximately bisimilar symbolic models for nonlinear control systems
• A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
• Stability analysis of some classes of input-affine nonlinear systems with aperiodic sampled-data control
• A polynomial approach for stability analysis of switched systems
• Sums of squares, moment matrices and optimization over polynomials
• Algebraic analysis on asymptotic stability of continuous dynamical systems
• Computing the distance between the linear matrix pencil and the completely positive cone
• Moments, positive polynomials and their applications
• Sum of squares method for sensor network localization
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Symmetry groups, semidefinite programs, and sums of squares
• Positive trigonometric polynomials and signal processing applications
• Local stability analysis of continuous-time Takagi-Sugeno fuzzy systems: a fuzzy Lyapunov function approach
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• Polynomial-approximation-based control for nonlinear systems
• Stability and stabilization of polynomial fuzzy systems with time delay: new approach
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Maximum block improvement and polynomial optimization
• Finiteness of spatial central configurations in the five-body problem
• Lyapunov conditions for input-to-state stability of impulsive systems
• Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
• Algorithm 996
• Discovering polynomial Lyapunov functions for continuous dynamical systems
• Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
• Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems
• Global minimization of rational functions and the nearest GCDs
• Global optimization of rational functions: a semidefinite programming approach
• Lyapunov function computation for autonomous systems with complex dynamic behavior
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
• Minimizing polynomials via sum of squares over the gradient ideal
• Probabilistic model validation for uncertain nonlinear systems
• Nonlinear H_∞ output feedback control with integrator for polynomial discrete‐time systems
• Stability analysis and stabilization of stochastic linear impulsive, switched and sampled-data systems under dwell-time constraints
• Computation of Lyapunov functions for nonautonomous systems on finite time-intervals by linear programming
• Nonnegative compartment dynamical system modelling with stochastic differential equations
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• Robust control of uncertain systems: classical results and recent developments
• Guaranteed error bounds for structured complexity reduction of biochemical networks
• Computation and Verification of Lyapunov Functions
• Batch sequential designs for computer experiments
• Hybrid Systems: Computation and Control
• Stability analysis of networked control systems: a sum of squares approach
• Verification and Control of Hybrid Systems
• Positive Forms and Stability of Linear Time-Delay Systems
• Adaptive output control of uncertain nonlinear systems with non-symmetric dead-zone input
• Rational univariate representation and its application in optimization problem
• Disciplined convex programming
• An algorithmic construction of entropies in higher-order nonlinear PDEs
• Polynomial constraints and unsat cores in \textsc{Tarski}
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• Introduction to Semidefinite, Conic and Polynomial Optimization
• Analysis of Non-polynomial Systems Using the Sum of Squares Decomposition
• Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
• Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
• Stability analysis and stabilization of LPV systems with jumps and (piecewise) differentiable parameters using continuous and sampled-data controllers
• Compositional abstraction-based synthesis for continuous-time stochastic hybrid systems
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• Automated and Sound Synthesis of Lyapunov Functions with SMT Solvers
• Equivalence of several stability conditions for switched linear systems with dwell time
• Design of continuous twisting algorithm
• Networked gain-scheduled fault diagnosis under control input dropouts without data delivery acknowledgment
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
• Saturated Feedback Control Using Different Higher-Order Sliding-Mode Algorithms
• State and disturbance observers-based polynomial fuzzy controller
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
• Lyapunov abstractions for inevitability of hybrid systems
• Trajectory Based Verification Using Local Finite-Time Invariance
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
• Extent-compatible control barrier functions
• Robust consensus for linear multi-agent systems with mixed uncertainties

This page was built for software: Sostools