A convex optimization model for finding non-negative polynomials
From MaRDI portal
Publication:5965344
DOI10.1016/j.cam.2016.01.018zbMath1382.90076OpenAlexW2255041805MaRDI QIDQ5965344
Publication date: 3 March 2016
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.01.018
Filtering in stochastic control theory (93E11) Semidefinite programming (90C22) Convex programming (90C25) Frequency-response methods in control theory (93C80) Applications of design theory to circuits and networks (94C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semidefinite programming approach to the generalized problem of moments
- Problems of distance geometry and convex properties of quadratic maps
- Matrix measures, moment spaces and Favard's theorem for the interval \([0,1\) and \([0,\infty)\)]
- Semidefinite programming relaxations for semialgebraic problems
- On the cone of positive semidefinite matrices
- A convex optimization method to solve a filter design problem
- Lectures on Modern Convex Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- The Pythagoras number of some affine algebras and local algebras.
- Barrier Functions in Interior Point Methods
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback