The nonlinear poximal point algorithm and multiplier methods

The nonlinear poximal point algorithm and multiplier methods

Bibliography: p. 33-34.

Bibliographic Details
Other Authors:	Luque, Javier.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:	TK7855.M41 E3845 no.1596
Online Access:	http://hdl.handle.net/1721.1/2952

Similar Items

The nonlinear proximal point algorithm
Published: (2003)

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

Analysis of robust H2 performance using multiplier theory
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)

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

On sampling methods and annealing algorithms
Published: (2002)

Series expansions for nonlinear filters
Published: (2003)

Geometric theory of nonlinear filtering
Published: (2003)

The auction algorithm : a distributed relaxation method for the assignment problem
Published: (2003)

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

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

Worst-case indentification of nonlinear fading memory systems
Published: (2003)

A methodology for designing robust nonlinear control systems
Published: (2003)

Guaranteed properties for nonlinear gain scheduled control systems
Published: (2003)

A functional expansion approach to the solution of nonlinear feedback systems
Published: (2002)

Optimization of multiclass queueing networks : polyhedral and nonlinear characterization of achievable performance
Published: (2003)

Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
Published: (2003)

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

Topology broadcast algorithms
Published: (2003)

Convergence of the simulated annealing algorithm
Published: (2003)

Rollout algorithms for combinatorial optimization
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

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

An auction algorithm for shortest paths
Published: (2003)

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

The Schur algorithm and its applications
Published: (2002)

Rollout algorithms for stochastic scheduling problems
Published: (2003)

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

A new parallel smoothing algorithm
Published: (2003)

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

Efficient algorithms for globally optimal trajectories
Published: (2003)

Polynomial auction algorithms for shortest paths
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

Finite termination of asynchronous iterative algorithms
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

Stability, stochastic stationarity, and generalized Lyapunov equations for two-point boundary-value descriptor systems
Published: (2003)

Stability, stochastic stationarity and generalized Lyapunov equations for two-point boundary-value descriptor systems
Published: (2003)

A hierarchical algorithm for limited-angle reconstruction
Published: (2003)

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