Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs
From MaRDI portal
Publication:5153670
DOI10.4208/aamm.2013.m316zbMath1488.35013OpenAlexW2403166606MaRDI QIDQ5153670
Chao Deng, Guangming Zhou, Kun Wu
Publication date: 30 September 2021
Published in: Advances in Applied Mathematics and Mechanics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/aamm.2013.m316
Semidefinite programming (90C22) Dynamics induced by flows and semiflows (37C10) Methods of ordinary differential equations applied to PDEs (35A24)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite representation of convex sets
- Bounds on measures satisfying moment conditions.
- An exact Jacobian SDP relaxation for polynomial optimization
- Positive polynomials on fibre products
- There are significantly more nonnegative polynomials than sums of squares
- Robust global optimization with polynomials
- Bounds on linear PDEs via semidefinite optimization
- Global Optimization with Polynomials and the Problem of Moments
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
This page was built for publication: Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs