Fast iterative computation of optimal two-block H/sup infinity /-norm
From MaRDI portal
Recommendations
- Fast approximation of the H_ norm via optimization over spectral value sets
- Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
- Optimal block iterative schemes for certain large, sparse,and nonsymmetric linear systems
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Sarason approach to optimal, 2-block and 4-block \(H^ \infty\) norm
- Block-Iterative Algorithms with Underrelaxed Bregman Projections
- scientific article; zbMATH DE number 465458
- Convergence of block iterative methods applied to sparse least-squares problems
- scientific article; zbMATH DE number 3992794
Cited in
(7)- Characterization of the sub-layers for 2-block \(H^{\infty}\)-optimal control problem
- On the numerical computation of the optimal H₂-norm and its associated fixed modes in H₂-optimization
- scientific article; zbMATH DE number 5370527 (Why is no real title available?)
- A gradient method for computing the optimal H/sub infinity / norm
- An alternative computational solution for optimal two-block Nehari and H problems
- On the computation of the optimal H_ norm of a parametric system achievable by a feedback controller
- Sarason approach to optimal, 2-block and 4-block \(H^ \infty\) norm
This page was built for publication: Fast iterative computation of optimal two-block H/sup infinity /-norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206635)
