A decomposition algorithm for convex differentiable minimization

A decomposition algorithm for convex differentiable minimization

Cover title.

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

Similar Items

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

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

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

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

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

Communication complexity of convex optimization
Published: (2003)

A simple polynomial-time algorithm for convex quadratic programming
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 exponential multiplier method for convex programming
Published: (2003)

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

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

Thevenin decomposition and large-scale optimization
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)

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)

Data fusion with minimal communication
Published: (2003)

On the relation of anticipative Stratonovich and symetric integrals : a decomposition formula
Published: (2003)

Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
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)

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

Structural decomposition of multiple time scale Markov processes
Published: (2003)

Conditions for scale-based decomposition in singularity perturbed systems
Published: (2003)

Bases for finite fields and a canonical decomposition for a normal basis generator
Published: (2003)

Relaxation method for large scale linear programming using decomposition
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)

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

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

Minimization of the maximum peak-to-peak gain--the general multiblock problem
Published: (2003)

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

L1Ì³ sensitivity minimization for plants with commensurate delays
Published: (2003)

H[infinity] weighted sensitivity minimization for systems with commensurate input lags
Published: (2003)

Time-varying compensation can yield no improvement for 1-sensitivity minimization
Published: (2003)

A decomposition method for the approximate evaluation of capacitated transfer line with unreliable machines and random processing times
Published: (2003)

Combined H[infinity]/LQG control via the optimal projection equations : on minimizing the LQG cost bound
Published: (2002)