Semidefinite programming relaxations and algebraic optimization in control
From MaRDI portal
Publication:2512289
DOI10.3166/ejc.9.307-321zbMath1293.93302OpenAlexW2163182586MaRDI QIDQ2512289
Publication date: 7 August 2014
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/ejc.9.307-321
Related Items
Polynomial level-set method for attractor estimation, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, Semidefinite relaxations of dynamical programs under discrete constraints, Geometric control of hybrid systems, Inner-estimating domains of attraction for discrete-time non-polynomial systems with piecewise difference inclusions, Bifurcation Analysis of a Predator–Prey System with Ratio-Dependent Functional Response, Structured semidefinite programs for the control of symmetric systems, Certifying Unstability of Switched Systems Using Sum of Squares Programming, RobustH∞performance using lifted polynomial parameter-dependent Lyapunov functions, An alternative approach for nonlinear optimal control problems based on the method of moments, Exact relaxations of non-convex variational problems, Multihomogeneous nonnegative polynomials and sums of squares, Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions, Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems, Convex relaxations for mixed integer predictive control, Distributed resource allocation with binary decisions via Newton-like neural network dynamics, A new method for robust Schur stability analysis, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, Global dynamics of a predator-prey system with density-dependent mortality and ratio-dependent functional response, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Bracketing backward reach sets of a dynamical system, Inner-approximating domains of attraction for discrete-time switched systems via multi-step multiple Lyapunov-like functions, Fundamental Domains for Symmetric Optimization: Construction and Search, Approximate dynamic programming via iterated Bellman inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- An algorithm for sums of squares of real polynomials
- On the Kalman-Yakubovich-Popov lemma
- Semidefinite programming in combinatorial optimization
- Convex optimization problems involving finite autocorrelation sequences
- Second-order cone programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An independent benchmarking of SDP and SOCP solvers
- Semidefinite programming relaxations for semialgebraic problems
- The complex structured singular value
- Uniform denominators in Hilbert's seventeenth problem
- Global Optimization with Polynomials and the Problem of Moments
- Hyperbolic Polynomials and Convex Analysis
- Quasilinear theory of current-driven ion-acoustic turbulence in a magnetized collisional plasma
- Semidefinite optimization
- Linear Matrix Inequalities in System and Control Theory
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- CSDP, A C library for semidefinite programming
- A cutting plane algorithm for robustness analysis of periodically time-varying systems
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- H/sub ∞/ design with pole placement constraints: an LMI approach
- Semidefinite programming duality and linear time-invariant systems
- GloptiPoly
- Handbook of semidefinite programming. Theory, algorithms, and applications
