Navigating in a Graph by Aid of Its Spanning Tree Metric

From MaRDI portal
Publication:5892569

DOI10.1137/090761549zbMath1243.49039OpenAlexW1994320209MaRDI QIDQ5892569

Bing-sheng He, Xiao-Ming Yuan, Ming-Hua Xu

Publication date: 15 June 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090761549




Related Items (39)

Application of the alternating direction method for an inverse monic quadratic eigenvalue problemA proximal quadratic surface support vector machine for semi-supervised binary classificationAn implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problemA proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problemsConvergence Study on the Symmetric Version of ADMM with Larger Step SizesUnnamed ItemOn the linear convergence of the general first order primal-dual algorithmNovel alternating update method for low rank approximation of structured matricesLimited memory BFGS algorithm for the matrix approximation problem in Frobenius normA parallel splitting method for separable convex programsA fast splitting method tailored for Dantzig selectorLimited memory BFGS method for least squares semidefinite programming with banded structureA note on the alternating direction method of multipliersA proximal fully parallel splitting method with a relaxation factor for separable convex programmingA new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliersOptimal matrix pencil approximation problem in structural dynamic model updatingConvergence study on the proximal alternating direction method with larger step sizeAn ADM-based splitting method for separable convex programmingAlternating direction method for structure-persevering finite element model updating problemSplitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observationsA double extrapolation primal-dual algorithm for saddle point problemsLinearized block-wise alternating direction method of multipliers for multiple-block convex programmingInexact alternating-direction-based contraction methods for separable linearly constrained convex optimizationAn implementable first-order primal-dual algorithm for structured convex optimizationProximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problemA customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraintsA class of linearized proximal alternating direction methodsOn Glowinski's open question on the alternating direction method of multipliersA class of multilevel structured low-rank approximation arising in material processingAccelerated method for optimization over density matrices in quantum state estimationOn the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliersLinearized augmented Lagrangian and alternating direction methods for nuclear norm minimizationOn the convergence analysis of the alternating direction method of multipliers with three blocksAn accelerated active-set algorithm for a quadratic semidefinite program with general constraintsA distributed Douglas-Rachford splitting method for multi-block convex minimization problemsThe Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with ApplicationsConvergence study of indefinite proximal ADMM with a relaxation factorSemidefinite inverse eigenvalue problems with prescribed entries and partial eigendataConvergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size


Uses Software



This page was built for publication: Navigating in a Graph by Aid of Its Spanning Tree Metric