The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm

Cover title.

Bibliographic Details
Other Authors:	Eckstein, Jonathan.
Language:	eng
Published:	Massachusetts Institute of Technology, Operations Research Center, Laboratory for Information and Decision Systems, Intelligent Control Systems 2003
Subjects:	TK7855.M41 E3845 no.1769
Online Access:	http://hdl.handle.net/1721.1/3060

Similar Items

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Published: (2003)

The nonlinear proximal point algorithm
Published: (2003)

Asymptotic convergence analysis of the proximal point algorithm
Published: (2002)

Partial proximal minimization algorithms for convex programming
Published: (2003)

On the convergence of a matrix splitting algorithm for the symmetric linear complementarity problem
Published: (2003)

Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
Published: (2003)

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
Published: (2003)

Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem
Published: (2003)

The nonlinear poximal point algorithm and multiplier methods
Published: (2003)

Geometric interpretation of multiaccess joint detection and the alternating projection algorithm
Published: (2003)

One-way multigrid algorithms and their optimality for a class of fixed-point problems
Published: (2003)

An alternating direction method for linear programming
Published: (2003)

Topology broadcast algorithms
Published: (2003)

The auction algorithm for the transportation problem
Published: (2003)

An auction algorithm for shortest paths
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

Rollout algorithms for combinatorial optimization
Published: (2003)

On the convergence of the affine-scaling algorithm
Published: (2003)

Convergence of the simulated annealing algorithm
Published: (2003)

On sampling methods and annealing algorithms
Published: (2002)

The Schur algorithm and its applications
Published: (2002)

On the universality of the LZ-based decoding algorithm
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

An auction algorithm for the max-flow problem
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

Efficient algorithms for globally optimal trajectories
Published: (2003)

A new parallel smoothing algorithm
Published: (2003)

Rollout algorithms for stochastic scheduling problems
Published: (2003)

Polynomial auction algorithms for shortest paths
Published: (2003)

Finite termination of asynchronous iterative algorithms
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Simulated annealing type algorithms for multivariate optimization
Published: (2003)

Simulated annealing type algorithms for multivariate optimization
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

A hierarchicial algorithm for neural training and control
Published: (2003)

A decomposition algorithm for convex differentiable minimization
Published: (2003)

A new algorithm for multiplication in finite fields
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

A diagnostics algorithm for impact printer actuator
Published: (2003)

A geometric projection-space reconstruction algorithm
Published: (2003)