Pages that link to "Item:Q5259698"

The following pages link to On Alternating Direction Methods of Multipliers: A Historical Perspective (Q5259698):

Displaying 50 items.

• Higher-degree eigenvalue complementarity problems for tensors (Q276860) (← links)
• Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
• Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
• A note on the convergence of ADMM for linearly constrained convex optimization problems (Q513720) (← links)
• An inexact alternating direction method of multipliers with relative error criteria (Q519776) (← links)
• Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization (Q723737) (← links)
• Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization (Q781096) (← links)
• Convergence study of indefinite proximal ADMM with a relaxation factor (Q782911) (← links)
• Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
• Convergence analysis on a modified generalized alternating direction method of multipliers (Q824590) (← links)
• A proximal alternating linearization method for minimizing the sum of two convex functions (Q892779) (← links)
• A partially isochronous splitting algorithm for three-block separable convex minimization problems (Q1670406) (← links)
• Improved susceptibility artifact correction of echo-planar MRI using the alternating direction method of multipliers (Q1703174) (← links)
• Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization (Q1706414) (← links)
• On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming (Q1741112) (← links)
• On inexact ADMMs with relative error criteria (Q1756581) (← links)
• Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming (Q1787117) (← links)
• The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex (Q1983679) (← links)
• First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds (Q2010134) (← links)
• The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
• Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms (Q2026767) (← links)
• A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing (Q2028037) (← links)
• Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids (Q2057230) (← links)
• Subgroup-effects models for the analysis of personal treatment effects (Q2135337) (← links)
• A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• An ADMM-based scheme for distance function approximation (Q2189406) (← links)
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming (Q2220658) (← links)
• Local linear convergence of an ADMM-type splitting framework for equality constrained optimization (Q2240104) (← links)
• Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces (Q2275278) (← links)
• An application of sparse-group Lasso regularization to equity portfolio optimization and sector selection (Q2288970) (← links)
• Optimally linearizing the alternating direction method of multipliers for convex programming (Q2301139) (← links)
• Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence (Q2322553) (← links)
• A Peaceman-Rachford splitting method with monotone plus skew-symmetric splitting for nonlinear saddle point problems (Q2333721) (← links)
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers (Q2350741) (← links)
• Alternating direction method of multipliers for linear programming (Q2361581) (← links)
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function (Q2397092) (← links)
• On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM (Q2398479) (← links)
• A proximal point analysis of the preconditioned alternating direction method of multipliers (Q2412837) (← links)
• A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints (Q2413272) (← links)
• Block-wise ADMM with a relaxation factor for multiple-block convex programming (Q2422129) (← links)
• Generalized alternating direction method of multipliers: new theoretical insights and applications (Q2516351) (← links)
• Neural network architectures using min-plus algebra for solving certain high-dimensional optimal control problems and Hamilton-Jacobi PDEs (Q2683498) (← links)
• A sequential updating scheme of the Lagrange multiplier for separable convex programming (Q2826683) (← links)
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes (Q3179612) (← links)
• Fiber Orientation Distribution Estimation Using a Peaceman--Rachford Splitting Method (Q3188198) (← links)
• A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds (Q3188211) (← links)
• A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging (Q3192655) (← links)
• 3/4-Discrete Optimal Transport (Q3303986) (← links)