Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities

DOI10.1134/S0005117914060150zbMath1325.93029MaRDI QIDQ891237

V. V. Pozdyayev

Publication date: 16 November 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

theory of momentsmultidimensional optimization problemspolynomial matrix inequalities constraintspolynomial objective function

Mathematics Subject Classification ID

System structure simplification (93B11) Transformations (93B17)

Related Items (3)

Dual form reduction in the atomic optimization method ⋮ Problems of computing norms of 2D systems ⋮ 2D system analysis via dual problems and polynomial matrix inequalities

Uses Software

• GloptiPoly
• COMPleib

Cites Work

• Design of Marx generators as a structured eigenvalue assignment
• Atomic optimization. I: Search space transformation and one-dimensional problems
• Global Optimization with Polynomials and the Problem of Moments
• A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
• NP-Hardness of Some Linear Control Design Problems
• Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

This page was built for publication: Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities