Pages that link to "Item:Q3537440"

The following pages link to Matrix Nearness Problems with Bregman Divergences (Q3537440):

Displaying 36 items.

• Geometry preserving multi-task metric learning (Q374164) (← links)
• Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method (Q447558) (← links)
• Optimal rates of convergence for sparse covariance matrix estimation (Q741791) (← links)
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
• Covariance structure regularization via entropy loss function (Q1623420) (← links)
• Multivariate GARCH estimation via a Bregman-proximal trust-region method (Q1623522) (← links)
• Optimal Bayesian minimax rates for unconstrained large covariance matrices (Q1631606) (← links)
• Estimation and empirical performance of non-scalar dynamic conditional correlation models (Q1659096) (← links)
• Generalization of clustering agreements and distances for overlapping clusters and network communities (Q1715904) (← links)
• Spline estimation of functional principal components via manifold conjugate gradient algorithm (Q2103990) (← links)
• Information geometry of operator scaling (Q2151570) (← links)
• Matrix versions of the Hellinger distance (Q2318010) (← links)
• Estimation of positive definite \(M\)-matrices and structure learning for attractive Gaussian Markov random fields (Q2341885) (← links)
• Computing the threshold of the influence of intercellular nanotubes on cell-to-cell communication integrity (Q2410405) (← links)
• A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties (Q2453184) (← links)
• Averaging Symmetric Positive-Definite Matrices (Q3300555) (← links)
• (Q4558156) (← links)
• A Bregman extension of quasi-Newton updates I: an information geometrical framework (Q4924106) (← links)
• A Unified Framework for Structured Graph Learning via Spectral Constraints (Q4969059) (← links)
• Geodesically Parameterized Covariance Estimation (Q4986827) (← links)
• Likelihood Geometry of Correlation Models (Q5030933) (← links)
• Correlation structure regularization via entropy loss function for high-dimension and low-sample-size data (Q5082586) (← links)
• (Q5094649) (← links)
• (Q5139651) (← links)
• Quantum entropic regularization of matrix-valued optimal transport (Q5242581) (← links)
• From joint convexity of quantum relative entropy to a concavity theorem of Lieb (Q5390228) (← links)
• New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
• Right mean for the \(\alpha - z\) Bures-Wasserstein quantum divergence (Q6116179) (← links)
• The method of randomized Bregman projections for stochastic feasibility problems (Q6156125) (← links)
• A Bregman–Kaczmarz method for nonlinear systems of equations (Q6492445) (← links)
• Distributed constrained optimization with periodic dynamic quantization (Q6537317) (← links)
• Preconditioner design via Bregman divergences (Q6561642) (← links)
• Penalized spline estimation of principal components for sparse functional data: rates of convergence (Q6589574) (← links)
• Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions (Q6644253) (← links)
• Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization (Q6667696) (← links)
• Information measures and geometry of the hyperbolic exponential families of Poincaré and hyperboloid distributions (Q6670446) (← links)