Fast approximation of the H∞ norm via optimization over spectral value sets

Nicola Guglielmi; Mert Gürbüzbalaban; Michael L. Overton

doi:10.1137/120875752

Publications · Journal article · SIAM J. Matrix Anal. Appl. 2013

Fast approximation of the H∞ norm via optimization over spectral value sets

Nicola Guglielmi, Mert Gürbüzbalaban, Michael L. Overton

SIAM Journal on Matrix Analysis and Applications, 34(2), pp. 709–737, 2013.

Publisher (DOI)

In brief

Develops fast algorithms for approximating the H∞ norm of large-scale dynamical systems by optimizing over spectral value sets — scalable alternatives to the classical Boyd–Balakrishnan bisection, and the computational root of the later control-theoretic analysis of optimization algorithms.

Topics

Spectral & nonsmooth optimization

Cite

@article{guglielmi2013hinf,
  title   = {Fast approximation of the {$H_\infty$} norm via optimization over spectral value sets},
  author  = {Nicola Guglielmi and Mert Gürbüzbalaban and Michael L. Overton},
  year    = {2013},
  journal = {SIAM Journal on Matrix Analysis and Applications},
  volume  = {34(2)},
  pages   = {709--737},
  doi     = {10.1137/120875752},
}

Relatedsame topics

Robustly stable accelerated momentum methods with a near-optimal L₂ gain and H∞ performance (Math. Oper. Res., 2025)
Boundary conditions for linear exit time gradient trajectories around saddle points: analysis and algorithm (IEEE Trans. Inf. Theory, 2023)
Approximating the real structured stability radius with Frobenius-norm bounded perturbations (SIAM J. Matrix Anal. Appl., 2017)
Polynomial root radius optimization with affine constraints (Math. Program., 2017)
Polynomial stabilization with bounds on the controller coefficients (ROCOND, 2015)

← All publications · Research program · Mert Gürbüzbalaban