Optimization Problems over Positive Pseudopolynomial Matrices
From MaRDI portal
Publication:4443800
DOI10.1137/S0895479803374840zbMath1055.90058MaRDI QIDQ4443800
Y. Genin, Paul Van Dooren, Yvan Hachez, Yu. E. Nesterov
Publication date: 18 January 2004
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Related Items
Detecting rigid convexity of bivariate polynomials, Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems, An alternative Kalman-Yakubovich-Popov lemma and some extensions, Distributed stabilisation of spatially invariant systems: positive polynomial approach, On the Kalman-Yakubovich-Popov lemma and the multidimensional models, On stabilisability of 2-D MIMO shift-invariant systems, Sum of squares generalizations for conic sets, Elliptic and hyperbolic quadratic eigenvalue problems and associated distance problems., Delay range stability of a class of distributed time delay systems, Positive polynomial matrices and improved LMI robustness conditions., A cutting plane method for solving KYP-SDPs, Sum-of-Squares Optimization without Semidefinite Programming, On the stability of 2D state‐space models, A convex optimization method to solve a filter design problem, Approximation of the joint spectral radius using sum of squares, Linear matrix inequality tests for frequency domain inequalities with affine multipliers, Time domain interpretations of frequency domain inequalities on (semi)finite ranges, Lyapunov-based exact stability analysis and synthesis for linear single-parameter dependent systems, Selected topics in robust convex optimization, LMI relaxations in robust control, Positivity and linear matrix inequalities, Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition, Numerical experiments with universal barrier functions for cones of Chebyshev systems, Unnamed Item, Sampling method for semidefinite programmes with non-negative Popov function constraints, Completely positive reformulations for polynomial optimization
