Partial proximal minimization algorithms for convex programming

Partial proximal minimization algorithms for convex programming

Caption title.

Detaylı Bibliyografya
Diğer Yazarlar:	Bertsekas, Dimitri P.
Dil:	eng
Baskı/Yayın Bilgisi:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] 2003
Konular:	TK7855.M41 E3845 no.2173
Online Erişim:	http://hdl.handle.net/1721.1/3313

Benzer Materyaller

A decomposition algorithm for convex differentiable minimization
Baskı/Yayın Bilgisi: (2003)

On the convergence of the coordinate descent method for convex differentiable minimization
Baskı/Yayın Bilgisi: (2003)

Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
Baskı/Yayın Bilgisi: (2003)

Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
Baskı/Yayın Bilgisi: (2003)

The nonlinear proximal point algorithm
Baskı/Yayın Bilgisi: (2003)

On the convergence of the exponential multiplier method for convex programming
Baskı/Yayın Bilgisi: (2003)

A note on error bounds for convex and nonconvex programs
Baskı/Yayın Bilgisi: (2003)

A note on error bounds for convex and nonconvex programs
Baskı/Yayın Bilgisi: (2003)

A simple polynomial-time algorithm for convex quadratic programming
Baskı/Yayın Bilgisi: (2003)

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
Baskı/Yayın Bilgisi: (2003)

Partial multinode broadcast and partial exchange algorithms for d-dimensional meshes
Baskı/Yayın Bilgisi: (2003)

Communication complexity of convex optimization
Baskı/Yayın Bilgisi: (2003)

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Baskı/Yayın Bilgisi: (2003)

Estimation algorithms for reconstructing a convex set given noisy measurments of its support lines
Baskı/Yayın Bilgisi: (2003)

Partially asynchronous, parallel algorithms for network flow and other problems
Baskı/Yayın Bilgisi: (2003)

On the rate of convergence of a partially asynchronous gradient projection algorithm
Baskı/Yayın Bilgisi: (2003)

Asymptotic convergence analysis of the proximal point algorithm
Baskı/Yayın Bilgisi: (2002)

Reconstructing convex sets from support line measurements
Baskı/Yayın Bilgisi: (2003)

Reconstruction of convex sets from noisy support line measurements
Baskı/Yayın Bilgisi: (2003)

Relaxation methods for problems with strictly convex separable costs and linear constraints
Baskı/Yayın Bilgisi: (2003)

An e-relaxation method for separable convex cost network flow problems
Baskı/Yayın Bilgisi: (2003)

On computing the nested sums and infimal convolutions of convex piecewise-linear functions
Baskı/Yayın Bilgisi: (2003)

Relaxation methods for problems with strictly convex costs and linear inequality constraints
Baskı/Yayın Bilgisi: (2003)

E-relaxation and auction method for separable convex cost network flow problems
Baskı/Yayın Bilgisi: (2003)

An E-relaxation method for separable convex cost generalized network flow problems
Baskı/Yayın Bilgisi: (2003)

Data fusion with minimal communication
Baskı/Yayın Bilgisi: (2003)

Estimating convex shapes from support line measurements using prior geometric information
Baskı/Yayın Bilgisi: (2003)

Dual coordinate ascent for problems with strictly convex costs and linear constraints : a unified approach
Baskı/Yayın Bilgisi: (2003)

Basis descent methods for convex essentially smooth optimization with applications to quadratic/entropy optimization and resource allocation
Baskı/Yayın Bilgisi: (2003)

A very simple polynomial-time algorithm for linear programming
Baskı/Yayın Bilgisi: (2003)

On synthesizing partially decentralized controllers
Baskı/Yayın Bilgisi: (2003)

Convex set estimation from support line measurements and applications to target reconstruction from laser radar data
Baskı/Yayın Bilgisi: (2003)

Robust controller design--minimizing peak-to-peak gain
Baskı/Yayın Bilgisi: (2003)

An operator-theoretic approach to the mixed-sensitivity minimization problem
Baskı/Yayın Bilgisi: (2003)

Coding for channels with partially localized errors
Baskı/Yayın Bilgisi: (2003)

Invariants of optimal minimal-order observer-based compensators
Baskı/Yayın Bilgisi: (2002)

Generalization of Huffman coding to minimize the probability of buffer overflow
Baskı/Yayın Bilgisi: (2002)

An operator-theoretic approach to the mixed-sensitivity minimization problem (I)
Baskı/Yayın Bilgisi: (2003)

L1Ì³ sensitivity minimization for plants with commensurate delays
Baskı/Yayın Bilgisi: (2003)

Minimization of the maximum peak-to-peak gain--the general multiblock problem
Baskı/Yayın Bilgisi: (2003)