String-averaging projected subgradient methods for constrained minimization

Yair Censor, Alexander J. Zaslavski

Research output: Contribution to journalArticlepeer-review


We consider constrained minimization problems and propose to replace the projection onto the entire feasible region, required in the projected subgradient method, by projections onto the individual sets whose intersection forms the entire feasible region. Specifically, we propose to perform such projections onto the individual sets in an algorithmic regime of a feasibility-seeking iterative projection method. For this purpose we use the recently developed family of dynamic string-averaging projection methods wherein iteration-index-dependent variable strings and variable weights are permitted. This gives rise to an algorithmic scheme that generalizes, from the algorithmic structural point of view, earlier work of Helou Neto and De Pierro, of Nedić, of Nurminski, and of Ram et al.

Original languageEnglish
Pages (from-to)658-670
Number of pages13
JournalOptimization Methods and Software
Issue number3
StatePublished - 4 May 2014

Bibliographical note

Funding Information:
The work of the first author was partially supported by the United States-Israel Binational Science Foundation (BSF) Grant number 200912 and US Department of Army Award number W81XWH-10-1-0170.


  • fixed point

ASJC Scopus subject areas

  • Software
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'String-averaging projected subgradient methods for constrained minimization'. Together they form a unique fingerprint.

Cite this