SearcharxivSearch

arXiv · 1408.0519

Bounded Real Lemma and structured singular value versus diagonal scaling: the free noncommutative setting

Abstract

The structured singular value $\mu$ was introduced independently by Doyle and Safanov as a tool for analyzing robustness of system stability and performance in the presence of structured uncertainty in the system parameters. While the structured singular value provides a necessary and sufficient criterion for robustness with respect to a structured ball of uncertainty, it is notoriously difficult to actually compute. The method of diagonal (or simply "D") scaling, on the other hand, provides an easily computable upper bound (which we call $\hat \mu$) for the structured singular value, but provides an exact evaluation of $\mu$ (or even a useful upper bound for $\mu$) only in special cases. However it was discovered in the 1990s that a certain enhancement of the uncertainty structure (i.e., letting the uncertainty parameters be freely noncommuting linear operators on an infinite-dimensional separable Hilbert space) resulted in the $D$-scaling procedure leading to an exact evaluation of $\mu_{\text{enhanced}}$ ($\mu_{\text{enhanced}} = \hat \mu$), at least for the tractable special cases which were analyzed in complete detail. On the one hand this enhanced uncertainty has some appeal from the physical point of view: one can allow the uncertainty in the plant parameters to be time-varying, or more generally, one can catch the uncertainty caused by the designer's decision not to model the more complex (e.g. nonlinear) dynamics of the true plant. On the other hand, the precise mathematical formulation of this enhanced uncertainty structure makes contact with developments in the growing theory of analytic functions in freely noncommuting arguments and associated formal power series in freely noncommuting indeterminates. In this article we obtain the $\widetilde \mu = \hat \mu$ theorem for a more satisfactory general setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Joseph A. Ball, Gilbert J. Groenewald, Sanne ter Horst. 2014-08-03. Bounded Real Lemma and structured singular value versus diagonal scaling: the free noncommutative setting. https://arxiv.org/abs/1408.0519

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC