Optimization Online


Spectral projected gradient method for stochastic optimization

Natasa Krejic(natasak***at***uns.ac.rs)
Natasa Krklec Jerinkić(natasa.krklec***at***dmi.uns.ac.rs)

Abstract: We consider the Spectral Projected Gradient method for solving constrained optimization problems with the objective function in the form of mathematical expectation. It is assumed that the feasible set is convex, closed and easy to project on. The objective function is approximated by a sequence of Sample Average Approximation functions with different sample sizes. The sample size update is based on two error estimates - SAA error and approximate solution error. The Spectral Projected Gradient method combined with a nonmonotone line search is used. The almost sure convergence results are achieved without imposing explicit sample growth condition. Numerical results show the efficiency of the proposed method.

Keywords: spectral projected gradient, constrained stochastic problems, sample average approximation, variable sample size

Category 1: Global Optimization


Download: [PDF]

Entry Submitted: 07/29/2015
Entry Accepted: 07/30/2015
Entry Last Modified: 07/29/2015

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 Optimization Society