Asymptotic convergence analysis of the proximal point algorithm

Asymptotic convergence analysis of the proximal point algorithm

Bibliography: p. 33-34.

Bibliographic Details
Other Authors:	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems 2002
Subjects:	TK7855.M41 E3845 no.1142 Convergence
Online Access:	http://hdl.handle.net/1721.1/985

Similar Items

The nonlinear proximal point algorithm
Published: (2003)

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
Published: (2003)

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

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

Convergence of the simulated annealing algorithm
Published: (2003)

A survey of large time asymptotics of simulated annealing algorithms
Published: (2003)

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

Convergence rate and termination of asynchronous iterative algorithms
Published: (2003)

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

On the rate of convergence of a partially asynchronous gradient projection algorithm
Published: (2003)

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

Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions
Published: (2003)

The asymptotic Toeplitz-circulant eigenvalue problem
Published: (2003)

Optimal asymptotic identification under bounded disturbances
Published: (2002)

Asymptotic orders of reachability in perturbed linear systems
Published: (2003)

Asymptotic worst-case identification with bounded noise
Published: (2003)

Asymptotic orders of reachability in perturbed linear systems
Published: (2003)

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

An asymptotic result for the multi-stage weapon-target allocation problem
Published: (2003)

Gradient convergence in gradient methods
Published: (2003)

Asymptotic buffer overflow probabilities in multiclass multiplexers : part I : the GPS policy
Published: (2003)

Asymptotic buffer overflow probabilities in multiclass multiplexers : part II : the GLQF policy
Published: (2003)

On the convergence of the exponential multiplier method for convex programming
Published: (2003)

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

On the convergence of the coordinate descent method for convex differentiable minimization
Published: (2003)

Convergence of asynchronous matrix iterations subject to diagonal dominance
Published: (2003)

Pade' approximants to matrix Stieltjes series : convergence and related properties
Published: (2003)

Asymptotic unbounded root loci : formulae and computation
Published: (2003)

Convergence study of an iterative joint detector for wavelet packet multiple-access communication
Published: (2003)

Point estimation, stochastic approximation, and robust Kalman filtering
Published: (2003)

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Published: (2003)

Asymptotic optimality of shortest path routing
Published: (2003)

Topology broadcast algorithms
Published: (2003)

On sampling methods and annealing algorithms
Published: (2002)

The Schur algorithm and its applications
Published: (2002)

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 universality of the LZ-based decoding algorithm
Published: (2003)