Pages that link to "Item:Q5892569"

The following pages link to Navigating in a Graph by Aid of Its Spanning Tree Metric (Q5892569):

Displaying 39 items.

• Application of the alternating direction method for an inverse monic quadratic eigenvalue problem (Q278291) (← links)
• An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
• A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (Q316185) (← links)
• A parallel splitting method for separable convex programs (Q382899) (← links)
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← links)
• On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers (Q505760) (← links)
• A class of linearized proximal alternating direction methods (Q658552) (← links)
• Convergence study of indefinite proximal ADMM with a relaxation factor (Q782911) (← links)
• A fast splitting method tailored for Dantzig selector (Q887167) (← links)
• Optimal matrix pencil approximation problem in structural dynamic model updating (Q902808) (← links)
• Alternating direction method for structure-persevering finite element model updating problem (Q907569) (← links)
• A proximal quadratic surface support vector machine for semi-supervised binary classification (Q1626225) (← links)
• Linearized block-wise alternating direction method of multipliers for multiple-block convex programming (Q1716995) (← links)
• An implementable first-order primal-dual algorithm for structured convex optimization (Q1724030) (← links)
• Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
• On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
• A note on the alternating direction method of multipliers (Q1934619) (← links)
• An ADM-based splitting method for separable convex programming (Q1946622) (← links)
• Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations (Q1955536) (← links)
• On the convergence analysis of the alternating direction method of multipliers with three blocks (Q2016702) (← links)
• An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)
• On the linear convergence of the general first order primal-dual algorithm (Q2165808) (← links)
• Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
• Convergence study on the proximal alternating direction method with larger step size (Q2200786) (← links)
• A double extrapolation primal-dual algorithm for saddle point problems (Q2211739) (← links)
• Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata (Q2346642) (← links)
• Novel alternating update method for low rank approximation of structured matrices (Q2402571) (← links)
• A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints (Q2450861) (← links)
• Limited memory BFGS method for least squares semidefinite programming with banded structure (Q2674941) (← links)
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes (Q3179612) (← links)
• A class of multilevel structured low-rank approximation arising in material processing (Q4641554) (← links)
• Accelerated method for optimization over density matrices in quantum state estimation (Q4643696) (← links)
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (Q4911905) (← links)
• (Q4969143) (← links)
• Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size (Q5030635) (← links)
• The Analytic Solutions of a Class of Constrained Matrix Minimization and Maximization Problems with Applications (Q5231680) (← links)
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems (Q5965003) (← links)
• A proximal fully parallel splitting method with a relaxation factor for separable convex programming (Q6086848) (← links)
• A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers (Q6151015) (← links)