A successive constraint approach to solving parameter-dependent linear matrix inequalities

DOI10.1016/j.crma.2017.05.001zbMath1369.65061arXiv1701.09021OpenAlexW2585788640MaRDI QIDQ2363537

Robert O'Connor

Publication date: 19 July 2017

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.09021

zbMATH Keywords

semidefinite programminglarge-scale linear matrix inequalitiessuccessive constraint approach

Mathematics Subject Classification ID

Related Items (1)

Continuous and discrete zeroing neural dynamics handling future unknown-transpose matrix inequality as well as scalar inequality of linear class

Cites Work

• Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
• A monotonic evaluation of lower bounds for inf-sup stability constants in the frame of reduced basis approximations
• A successive constraint linear optimization method for lower bounds of parametric coercivity and inf-sup stability constants
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• A Spectral Bundle Method for Semidefinite Programming
• Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
• Semidefinite Programming
• Analysis and synthesis of robust control systems via parameter-dependent Lyapunov functions

This page was built for publication: A successive constraint approach to solving parameter-dependent linear matrix inequalities