Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
From MaRDI portal
Publication:891237
DOI10.1134/S0005117914060150zbMATH Open1325.93029MaRDI QIDQ891237FDOQ891237
Authors: V. V. Pozdyayev 
Publication date: 16 November 2015
Published in: Automation and Remote Control (Search for Journal in Brave)
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
theory of momentsmultidimensional optimization problemspolynomial matrix inequalities constraintspolynomial objective function
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 (5)
- A method for solving a discrete optimization problem with polynomially tabular functions
- 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
Uses Software
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)
