scientific article; zbMATH DE number 124637

MaRDI QIDQ4026286zbMATH OpenFDO

Authors Yair Censor, Stavros A. Zenios

Publication date 21 February 1993

zbMATH Keywords

\(D\)-functionsparallel computingprimal-dual algorithmsreview

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Convex programming (90C25)

Review text

[For the entire collection see Zbl 0745.00050.] This is essentially a brief review paper describing the use of \(D\)- functions in constrained optimization. A \(D\)-function is constructed from \(f: R^ n\to R\) via \(D(x,y):= f(x)-f(y)-\langle \nabla f(y),x-y\rangle\). It can be used to define projections (orthogonal or non-orthogonal) onto convex sets by minimizing \(D(x,y)\) over all \(x\) in the set for the fixed \(y\) whose projection onto the set is sought. In particular, it has been used for linearly constrained convex optimization problems and extremely large linear programming problems. There is brief mention of its advantageous use in parallel computing. Many references are given.

Recommendations

• Proximal minimization algorithm with \(D\)-functions
• Multiplicative iterative algorithms for convex programming
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• scientific article; zbMATH DE number 3950216
• A Decomposition Method and Its Application to Convex Programming

Cited in

(3)

• Data parallel computing for network-structured optimization problems
• Proximal minimizations with D-functions and the massively parallel solution of linear network programs
• Iterative approaches to convex feasibility problems in Banach spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4026286)