Smoothing projected gradient method and its application to stochastic linear complementarity problems

Chao Zhang, Xiaojun Chen

Research output: Journal article publicationJournal articleAcademic researchpeer-review

56 Citations (Scopus)


A smoothing projected gradient (SPG) metho d is proposed for the minimization problem on a closed convex set, where the objective function is locally Lipschitz continuous but nonconvex, nondifferentiable. We show that any accumulation point generated by the SPG method is a stationary point associated with the smoothing function used in the method, which is a Clarke stationary point in many applications. We apply the SPG method to the stochastic linear complementarity problem (SLCP) and image restoration problems. We study the stationary point defined by the directional derivative and provide necessary and sufficient conditions for a local minimizer of the expected residual minimization (ERM) formulation of SLCP. Preliminary numerical experiments using the SPG method for solving randomly generated SLCP and image restoration problems of large sizes show that the SPG method is promising.
Original languageEnglish
Pages (from-to)627-649
Number of pages23
JournalSIAM Journal on Optimization
Issue number2
Publication statusPublished - 30 Nov 2009


  • Constrained optimization
  • Image restoration
  • Nonconvex
  • Nonsmooth
  • Smoothing projected gradient method
  • Stochastic linear complementarity problem

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software

Cite this