Branch and bound algorithm with applications to robust stability

DOI10.1007/s10898-016-0424-6zbMath1365.90221OpenAlexW2307598113MaRDI QIDQ513164

Dominikus Noll, Laleh Ravanbod, Pierre Apkarian

Publication date: 3 March 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0424-6

zbMATH Keywords

nonsmooth optimizationbranch and bounddynamical systemparametric robustnessfrequency decompositionminimum stability degreestability margin

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (2)

Optimizing the Kreiss Constant ⋮ Regularity radius: Properties, approximation and a not a priori exponential algorithm

Uses Software

• Robust Control Toolbox
• SMAC
• Mu Analysis and Synthesis Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth bundle trust-region algorithm with applications to robust stability
• Design of robust model-based controllers via parametric programming.
• Checking robust nonsingularity is NP-hard
• Integral global minimization: Algorithms, implementations and numerical tests
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
• Nonsmooth optimization for multidisk \(H_\infty\) synthesis
• Global Optimization with Polynomials and the Problem of Moments
• Fast computation of the multivariable stability margin for real interrelated uncertain parameters
• Robustness in the presence of mixed parametric uncertainty and unmodeled dynamics
• Exact calculation of the multiloop stability margin
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• Computational complexity of μ calculation
• NP-Hardness of Some Linear Control Design Problems

This page was built for publication: Branch and bound algorithm with applications to robust stability