Optimization Online


"Seminorm-induced oblique projections for sparse nonlinear convex feasibility problems"

Alexander Segal(asegal***at***math.haifa.ac.il)
Yair Censor(yair***at***math.haifa.ac.il)

Abstract: Simultaneous subgradient projection algorithms for the convex feasibility problem use subgradient calculations and converge sometimes even in the inconsistent case. We devise an algorithm that uses seminorm-induced oblique projections onto super half-spaces of the convex sets, which is advantageous when the subgradient-Jacobian is a sparse matrix at many iteration points of the algorithm. Using generalized seminorm-induced oblique projections on hyperplanes defined by subgradients at each iterative step, allows component-wise diagonal weighting which has been shown to be useful for early acceleration in the sparse linear case. Convergence for the consistent case with underrelaxation is established.

Keywords: Oblique projections, seminorm, sparse nonlinear convex feasibility, subgradient projections

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Nonlinear Systems and Least-Squares )

Citation: in: Y. Censor, M. Jiang and G. Wang (Editors), "Biomedical Mathematics: Promising Directions in Imaging, Therapy Planning and Inverse Problems", Medical Physics Publishing, Madison, WI, USA, 2009, accepted for publication.

Download: [PDF]

Entry Submitted: 07/20/2009
Entry Accepted: 07/23/2009
Entry Last Modified: 07/20/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society