Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities

DOI10.1134/S0005117914060150zbMATH Open1325.93029MaRDI QIDQ891237FDOQ891237

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)

Cites Work

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

Cited In (3)

• 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

Uses Software

• GloptiPoly
• COMPleib

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)