Peak estimation of rational systems using convex optimization
From MaRDI portal
Recommendations
- Upper bounds on peaks in discrete-time linear systems
- On finding the minimum possible peak value of multi-input infinite-horizon steering controls
- Convergent upper bounds of peak response of LTI and polytopic LTV systems through LMIs
- Reliable state-space upper bounds for the peak structured singular value
- Computation of peak output for inputs satisfying many bounding conditions on magnitude and slope
Cites work
- A study of the double pendulum using polynomial optimization
- Bounding extrema over global attractors using polynomial optimisation
- Bounding extreme events in nonlinear dynamics using convex optimization
- Bounding the Distance to Unsafe Sets With Convex Optimization
- Continuity equations and ODE flows with non-smooth velocity
- Convergence of Lasserre's hierarchy: the general case
- Converging outer approximations to global attractors using semidefinite programming
- Convex computation of the maximum controlled invariant set for polynomial control systems
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Exploiting Algebraic Structure in Sum of Squares Programs
- From infinite to finite programs: explicit error bounds with applications to approximate dynamic programming
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- JuMP 1.0: recent improvements to a modeling language for mathematical optimization
- Linear Programming Formulation for Optimal Stopping Problems
- Measure theory. Vol. I and II
- Michaelis-Menten networks are structurally stable
- Minimizing the sum of many rational functions
- On the complexity of Putinar's Positivstellensatz
- Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems
- Relaxation of optimal control problems to equivalent convex programs
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Theoretical and numerical analysis of differential-algebraic equations
- There are significantly more nonnegative polynomials than sums of squares
- Towards a system theory of rational systems
- Über die Darstellung definiter Formen als Summe von Formenquadraten.
This page was built for publication: Peak estimation of rational systems using convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652245)
