On the convergence of the coordinate descent method for convex differentiable minimization

On the convergence of the coordinate descent method for convex differentiable minimization

Cover title.

Bibliographic Details
Other Authors:	Luo, Zhi-Quan.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:	TK7855.M41 E3845 no.1924
Online Access:	http://hdl.handle.net/1721.1/3164

Similar Items

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

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

Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation
Published: (2003)

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

Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
Published: (2003)

Gradient convergence in gradient methods
Published: (2003)

Relaxation methods for problems with strictly convex costs and linear inequality constraints
Published: (2003)

Relaxation methods for problems with strictly convex separable costs and linear constraints
Published: (2003)

An e-relaxation method for separable convex cost network flow problems
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

E-relaxation and auction method for separable convex cost network flow problems
Published: (2003)

An E-relaxation method for separable convex cost generalized network flow problems
Published: (2003)

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

Dual coordinate ascent methods for linear network flow problems
Published: (2003)

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

Convergence of the simulated annealing algorithm
Published: (2003)

A note on error bounds for convex and nonconvex programs
Published: (2003)

Reconstructing convex sets from support line measurements
Published: (2003)

A note on error bounds for convex and nonconvex programs
Published: (2003)

Reconstruction of convex sets from noisy support line measurements
Published: (2003)

On computing the nested sums and infimal convolutions of convex piecewise-linear functions
Published: (2003)

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

Data fusion with minimal communication
Published: (2003)

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

Coordination in decision-making organizations
Published: (2003)

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

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

Coordination in organizations with decision support systems
Published: (2003)

Estimating convex shapes from support line measurements using prior geometric information
Published: (2003)

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

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

Coordinate ascent for maximizing nondifferentiable concave functions
Published: (2003)

An iterative coordination approach to decentralized decision problems
Published: (2002)

Estimation algorithms for reconstructing a convex set given noisy measurments of its support lines
Published: (2003)

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

Convergence of a gradient projection method
Published: (2003)

Robust controller design--minimizing peak-to-peak gain
Published: (2003)

An operator-theoretic approach to the mixed-sensitivity minimization problem
Published: (2003)

Invariants of optimal minimal-order observer-based compensators
Published: (2002)

Generalization of Huffman coding to minimize the probability of buffer overflow
Published: (2002)