Results 231 to 240 of about 404,975 (273)
Some of the next articles are maybe not open access.

Alternating Direction Methods on Multiprocessors

SIAM Journal on Scientific and Statistical Computing, 1987
We propose several implementations of the alternating direction method (ADM) for solving parabolic partial differential equations on multiprocessors. A complexity analysis of these implementations shows that the method can be made highly efficient on parallel architectures by using pipelining and variations of the classical Gaussian elimination ...
Johnsson, S. Lennart   +2 more
openaire   +1 more source

Parallel alternating direction method of multipliers

Information Sciences, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiaqi Yan   +3 more
openaire   +2 more sources

A Note on the Alternating Direction Method of Multipliers

Journal of Optimization Theory and Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Deren, Yuan, Xiaoming
openaire   +3 more sources

Bi-alternating direction method of multipliers

2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013
The alternating-direction method of multipliers (ADMM) has been widely applied in the field of distributed optimization and statistic learning. ADMM iteratively approaches the saddle point of an augmented Lagrangian function by performing three updates per-iteration.
Guoqiang Zhang 0003, Richard Heusdens
openaire   +1 more source

Accelerated Alternating Direction Method of Multipliers

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015
Recent years have seen a revival of interest in the Alternating Direction Method of Multipliers (ADMM), due to its simplicity, versatility, and scalability. As a first order method for general convex problems, the rate of convergence of ADMM is O(1=k) [4, 25].
Mojtaba Kadkhodaie   +3 more
openaire   +1 more source

Alternating Direction Implicit Methods

1962
Publisher Summary Alternating direction implicit methods, or ADI methods as they are called for short, constitute powerful techniques for solving elliptic and parabolic partial difference equations. However, in contrast with systematic overrelaxation methods, their effectiveness is hard to explain rigorously with any generality.
Garrett Birkhoff   +2 more
openaire   +2 more sources

Alternating Direction Method for Balanced Image Restoration

IEEE Transactions on Image Processing, 2012
This paper presents an efficient algorithm for solving a balanced regularization problem in the frame-based image restoration. The balanced regularization is usually formulated as a minimization problem, involving an l(2) data-fidelity term, an l(1) regularizer on sparsity of frame coefficients, and a penalty on distance of sparse frame coefficients
Shoulie Xie, Susanto Rahardja
openaire   +2 more sources

Fast Consensus by the Alternating Direction Multipliers Method

IEEE Transactions on Signal Processing, 2011
The alternating direction multipliers method (ADMM) has been recently proposed as a practical and efficient algorithm for distributed computing. We discuss its applicability to the average consensus problem in this paper. By carefully relaxing ADMM augmentation coefficients we are able to analytically investigate its properties, and to propose simple ...
ERSEGHE, TOMASO   +3 more
openaire   +2 more sources

The Alternating-Directions Method

1989
In this chapter we consider special iterative methods for solving grid elliptic equations of the form Au = f where the operator A possesses a definite structure. In Section 11.1 the alternating-directions method is studied in the commutative case; an optimal set of parameters is constructed.
Aleksandr A. Samarskii   +1 more
openaire   +1 more source

A Class of Linearized Proximal Alternating Direction Methods

Journal of Optimization Theory and Applications, 2011
The paper is devoted to some new alternating direction methods (ADMs) for the solution of structured separable convex minimization problems. The idea leading to these methods is to linearize the quadratic term in the objective function of either one or both subproblems to be solved and to add a proximal term to the objective function in case it is ...
Minghua Xu 0002, Ting Wu 0009
openaire   +1 more source

Home - About - Disclaimer - Privacy