A quadratic programming approach for solving the l/sub 1/ multiblock problem
From MaRDI portal
DOI10.1109/9.718608zbMATH Open0960.93010OpenAlexW2561647254MaRDI QIDQ4507201FDOQ4507201
Authors: Nicola Elia, Munther A. Dahleh
Publication date: 17 October 2000
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.718608
Recommendations
- Minimization of the maximum peak-to-peak gain: the general multiblock problem
- \(l_1\)-suboptimal pole placement design
- A new approach to the solution of the l/sub 1/ control problem: the scaled-Q method
- A simple solution to the \(\ell ^ 1\) optimization problem
- Mixed sensitivity minimization problems with rational \(\ell^ 1\)-optimal solutions
convergenceboundscomputational methodssemidefinite quadratic programming\(Q\)-designmultiblock \(l_1\)-problem
Cited In (8)
- On quasiblock discrete programming problems with supplementary constraints
- Fault-accommodation with intelligent sensors
- The Four-Block Model Matching Problem in $l^1 $ and Infinite-Dimensional Linear Programming
- A simple solution to the \(\ell ^ 1\) optimization problem
- Evolutionary Computation in Combinatorial Optimization
- Robust stabilization of uncertain systems with persistent disturbance and a class of non-linear actuators
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A quadratic programming approach for solving the l/sub 1/ multiblock problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507201)