Communication complexity of convex optimization

Communication complexity of convex optimization

Bibliography: leaf 10.

Bibliographic Details
Other Authors:	Tsitsiklis, John N.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:	TK7855.M41 E3845 no.1617
Online Access:	http://hdl.handle.net/1721.1/2965

Similar Items

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

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

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

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

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

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

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

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

Low complexity signal processing and optimal joint detection for over-saturated multiple access communications
Published: (2003)

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

On the communication complexity of distributed algebraic computation
Published: (2003)

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

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

Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
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)

Optimal communication algorithms for hypercubes
Published: (2003)

On the communication complexity of solving a polynominal equation
Published: (2003)

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

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

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

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)

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

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

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

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

The complexity of optimal queueing network control
Published: (2003)

Convex set estimation from support line measurements and applications to target reconstruction from laser radar data
Published: (2003)

Reference transmission and receiver optimization for coherent optical communication systems
Published: (2003)

Low complexity optimal multiple access joint detection for linearly dependent user sets
Published: (2003)

A simple polynomial-time algorithm for convex quadratic programming
Published: (2003)

Communication aspects of parallel processing
Published: (2003)

Reliable communication on data links
Published: (2003)

Data fusion with minimal communication
Published: (2003)

LQG control with communication constraints
Published: (2003)

Challenges to control in signal processing and communications
Published: (2003)

Wavelet-packet-based multiple access communication
Published: (2003)

End-to-end reliable communication in data networks
Published: (2003)

The complexity of Markov decision processes
Published: (2003)