The nonlinear poximal point algorithm and multiplier methods

The nonlinear poximal point algorithm and multiplier methods

Bibliography: p. 33-34.

গ্রন্থ-পঞ্জীর বিবরন
অন্যান্য লেখক:	Luque, Javier.
ভাষা:	eng
প্রকাশিত:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
বিষয়গুলি:	TK7855.M41 E3845 no.1596
অনলাইন ব্যবহার করুন:	http://hdl.handle.net/1721.1/2952

অনুরূপ উপাদানগুলি

The nonlinear proximal point algorithm
প্রকাশিত: (2003)

On the convergence of the exponential multiplier method for convex programming
প্রকাশিত: (2003)

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
প্রকাশিত: (2003)

Analysis of robust H2 performance using multiplier theory
প্রকাশিত: (2003)

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
প্রকাশিত: (2003)

One-way multigrid algorithms and their optimality for a class of fixed-point problems
প্রকাশিত: (2003)

On sampling methods and annealing algorithms
প্রকাশিত: (2002)

Series expansions for nonlinear filters
প্রকাশিত: (2003)

Geometric theory of nonlinear filtering
প্রকাশিত: (2003)

Asymptotic convergence analysis of the proximal point algorithm
প্রকাশিত: (2002)

The auction algorithm : a distributed relaxation method for the assignment problem
প্রকাশিত: (2003)

Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions
প্রকাশিত: (2003)

Worst-case indentification of nonlinear fading memory systems
প্রকাশিত: (2003)

A methodology for designing robust nonlinear control systems
প্রকাশিত: (2003)

Guaranteed properties for nonlinear gain scheduled control systems
প্রকাশিত: (2003)

A functional expansion approach to the solution of nonlinear feedback systems
প্রকাশিত: (2002)

Point estimation, stochastic approximation, and robust Kalman filtering
প্রকাশিত: (2003)

Optimization of multiclass queueing networks : polyhedral and nonlinear characterization of achievable performance
প্রকাশিত: (2003)

Mathematical equivalence of the auction algorithm for assignment and the e-relaxation (preflow-push) method for min cost flow
প্রকাশিত: (2003)

Topology broadcast algorithms
প্রকাশিত: (2003)

Convergence of the simulated annealing algorithm
প্রকাশিত: (2003)

Rollout algorithms for combinatorial optimization
প্রকাশিত: (2003)

Optimal communication algorithms for hypercubes
প্রকাশিত: (2003)

The auction algorithm for the transportation problem
প্রকাশিত: (2003)

An auction algorithm for shortest paths
প্রকাশিত: (2003)

On the convergence of the affine-scaling algorithm
প্রকাশিত: (2003)

The Schur algorithm and its applications
প্রকাশিত: (2002)

Stability, stochastic stationarity, and generalized Lyapunov equations for two-point boundary-value descriptor systems
প্রকাশিত: (2003)

Stability, stochastic stationarity and generalized Lyapunov equations for two-point boundary-value descriptor systems
প্রকাশিত: (2003)

Rollout algorithms for stochastic scheduling problems
প্রকাশিত: (2003)

On the universality of the LZ-based decoding algorithm
প্রকাশিত: (2003)

A new parallel smoothing algorithm
প্রকাশিত: (2003)

An auction algorithm for the max-flow problem
প্রকাশিত: (2003)

Efficient algorithms for globally optimal trajectories
প্রকাশিত: (2003)

Polynomial auction algorithms for shortest paths
প্রকাশিত: (2003)

Parallel shortest path auction algorithms
প্রকাশিত: (2003)

Finite termination of asynchronous iterative algorithms
প্রকাশিত: (2003)

Modified auction algorithms for shortest paths
প্রকাশিত: (2003)

A hierarchical algorithm for limited-angle reconstruction
প্রকাশিত: (2003)

Partial proximal minimization algorithms for convex programming
প্রকাশিত: (2003)