Minimizing the Euclidean Condition Number
From MaRDI portal
Recommendations
- Condition number minimization in Euclidean Jordan algebras
- Minimizing Condition Number via Convex Programming
- Remarks on Euclidean minima
- Computation of the Euclidean minimum of algebraic number fields
- On minimum norm problems
- Euclidean minima of totally real number fields: Algorithmic determination
- On the optimality conditions for the problem of minimizing a sum of euclidean norms
- Euclidean matchings and minimality of hyperplane arrangements
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- scientific article; zbMATH DE number 1552883
Cited in
(13)- A model matching approach for designing decentralized MIMO controllers
- Diagonal scaling of ill-conditioned matrixes by genetic algorithm
- Cross-directional control of sheet and film processes
- Remarks on Euclidean minima
- Numerical stability of optimal mean variance portfolios
- Nearly Optimal Block-Jacobi Preconditioning
- Scalable frames
- Performance analysis of linear and nonlinear techniques for automatic scaling of discretized control problems
- Generalized scalings satisfying linear equations
- Scalable approximate optimal diagonal preconditioning
- Graph-based dwell time computation methods for discrete-time switched linear systems
- Characteristic locus method robustness improvement through optimal static normalizing pre-compensation
- Robust consensus of uncertain linear multi-agent systems via dynamic output feedback
This page was built for publication: Minimizing the Euclidean Condition Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4316288)
