Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
From MaRDI portal
Recommendations
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Dual form reduction in the atomic optimization method
- Global optimization of polynomials over real algebraic sets
- Global optimization with polynomials and the problem of moments
- Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality
Cites work
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Design of Marx generators as a structured eigenvalue assignment
- Global optimization with polynomials and the problem of moments
- NP-Hardness of Some Linear Control Design Problems
Cited in
(6)- A method for solving a discrete optimization problem with polynomially tabular functions
- Atomic optimization. I: Search space transformation and one-dimensional problems
- Dual form reduction in the atomic optimization method
- 2D system analysis via dual problems and polynomial matrix inequalities
- Problems of computing norms of 2D systems
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization
This page was built for publication: Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891237)
