Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 75 for “"Majorization"”.
-
Majorization in the Bergman space
… values of the inner radius of the annulus of majorization are determined in the case that one of the functions in question is a monomial.
-
Angles, Majorization, Wielandt Inequality and Applications
… This naturally brings us to the world of majorization. After introducing the notion of majorization, we present some classical as well as recent results on eigenvalue majorization. Several new norm inequalities are derived by making use of a powerful decomposition lemma for positive …
-
Majorization and the Schur-Horn Theorem.
We study majorization in Rn and some of its properties. The concept of majorization plays an important role in matrix analysis by producing several useful relationships. We find out that there is a strong relationship between majorization and doubly stochastic matrices; this relation has been …
-
Majorization: its extensions and the preservation theorems
… deals mainly with the orderings induced by majorizatIon, the two weak majorizations and their associated inequalities. One of these weak majorizations has received some attention in the literature. However, the other one, being dual to the former, is totally overlooked. Schur functions which …
-
Majorization and pseudo-subordination of a class of analytic functions
In this thesis, we combine techniques used in Barnard and Kellogg's paper, Ruscheweyh's subordination result, (1.4), variational techniques, and geometric properties of Mobius transformations to verify the following theorem: Theorem 1.1. If F G K* and f ^w F in D with /'(0) > 0, then f < F' for z G …
-
Contributions to the theory of stochastic convexity and stochastic majorization.
… theory of stochastic convexity and stochastic majorization. In the first part of this dissertation, we develop an operator-analytic approach to study temporal stochastic convexity and concavity of Markov processes. We obtain sufficient and necessary conditions for the process {X(t),t ∊ S} which …
-
Majorization-projection methods for multidimensional scaling via Euclidean distance matrix optimization
… projection of the unique solution of the convex majorization onto a box set enjoys a closed form, leading to an extraordinarily efficient algorithm dubbed as MPEDM, an abbreviation for Majorization-Projection via EDM optimization. We prove that MPEDM involving four objective functions converges …
-
Examination of the Constant Trace Value Condition of a SIC-POVM and Various Majorization Relations from Games of Chance
… that the proof of their existence remains open. Majorization relations have played an important role in quantum Shannon theory. We construct families of games of chance whose pay-off gives rise to three different types of majorization relations: the standard vector majorization, conditional …
-
Uncertainty and entropies of classical channels
… states. The concept of probability vector majorization and its variants, relative majorization and conditional majorization, are reviewed. This thesis introduces three conceptually distinct approaches to formalize the notion of uncertainty inherent in classical channels. These three …
-
Conic Linear Programming in Quantum Information
… family of conversion resource monotones for majorization as a subset of f-divergences. For classical conditional majorization, necessary and sufficient conditions for state conversion are derived in the form of a homogeneous convex function. We unified the pre-existing results under the …
-
Systemic risk in financial networks
… networks in two directions. First, we develop a majorization-based tool to compare financial networks in terms of systemic losses with a focus on the implications of liability concentration. Specifically, we quantify liability concentration by applying the majorization order to the liability …
-
Further developments of Multidimensional Scaling via Euclidean Distance Matrix Optimization
… the semi-definite programming (SDP) approach and majorization method SMACOF, Euclidean distance matrix (EDM) optimization is proved to be numerically outstanding. This thesis aims to develop the MDS in different directions via EDM optimization. Firstly, we proposed to improve slacked supervised …
-
Classical Multidimensional Scaling: New Perspectives from EDM Optimization
… of the proximal ADMM, we then develop fast majorization algorithms for both the subspace model and the full space model. We establish their convergence to a stationary point, which is the best outcome in general expected of an optimization algorithm. The majorization has been based on a …
-
A Framework for Uncertainty Relations
… and its matrix representation. By virtue of majorization uncertainty bounds, we are able to construct the entanglement criteria which have advantage over the scalar detect- ing algorithms as they are often stronger and tighter. Furthermore, we explore various expression of entropic …
-
Matrix Analysis and Operator Theory with Applications to Quantum Information Theory
… to quantum states; such partial orders, namely majorization and trumping, have been linked to entanglement theory. We characterize trumping first by means of yet another partial order, power majorization, which gives rise to a family of examples. We then characterize trumping through the …
-
Locally Adaptive Protocols for Quantum State Discrimination
… for all pre-orders (corresponding to majorization, conditional majorization, and channel majorization respectively), and this defines the unique asymptotically continuous entropy function for classical channels. </p>
-
A Penalty Method for Correlation Matrix Problems with Prescribed Constraints
… we first apply the essential idea of the majorization method by solving a sequence of unconstrained inner problems iteratively. Actually, the inner problem is generated by the Lagrangian dual approach based on the metric projection and the Moreau-Yosida regularization. Since the objective …
-
A Study on Weighted and Structured Low Rank Matrix Optimization Problems
… that satisfies (i) and (ii) called Sequential Majorization Method (SMM). The framework of majorization method introduces guaranteed convergence by successfully solving the subproblem of each iterate, which ensures the sandwich inequality. At the same time, the latest gradient information is …
-
Component-Weighted Sparse Group LASSO for Variable Selection in Finite Mixture Regression Models
… develop a novel optimization procedure through a Majorization-Minimization algorithm. Simulation studies under Gaussian and Poisson mixture regression settings demonstrate reliable recovery of the true sparsity structure at both levels. The method is illustrated by analyzing two real datasets.
Page 1 of 4