Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation

Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation

Cover title.

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

Similar Items

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

Communication complexity of convex optimization
Published: (2003)

Closed-loop structural stability for linear-quadratic optimal systems
Published: (2002)

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

Linear-quadratic optimal control revisited
Published: (2002)

Integral quadratic constraints for systems with rate limiters
Published: (2003)

Discrete-time Markovian jump linear quadratic optimal control
Published: (2002)

Optimal smoothing and estimation for hybrid state processes
Published: (2003)

Robust linear quadratic designs with real parameter uncertainty
Published: (2003)

Multiscale smoothing error models
Published: (2003)

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

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

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

A new parallel smoothing 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)

Invariant geometric evolutions of surfaces and volumetric smoothing
Published: (2003)

Parallel smoothing algorithms for causal and acausal systems
Published: (2002)

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

Certainty equivalent solutions of quadratic team problems by a decentralized innovations approach
Published: (2002)

Construction and applications of discrete-time smoothing error models
Published: (2003)

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

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

An e-relaxation method for separable convex cost network flow problems
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)

A path-following algorithm for linear programming using quadratic and logarithmic penalty functions
Published: (2003)

Intelligent optimal control
Published: (2003)

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

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

On metric entropy, Vapnik-Chervonenkis dimension, and learnability for a class of distributions
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

On the distributions of optimized multiscale representations
Published: (2003)

Parallel computing in network optimization
Published: (2003)

Rollout algorithms for combinatorial optimization
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)