LINEARIZATION METHOD FOR NONSMOOTH STOCHASTIC PROGRAMMING PROBLEMS.

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

For a stochastic programming problem with a nonsmooth objective a recursive stochastic subgradient method is proposed in which successive directions are obtained from quadratic programming subproblems. The subproblems result from linearization of original constraints and from approximation of the objective by a quadratic function involving stochastic epsilon -subgradient estimates constructed in the course of computation. A special Lyapunov function technique is used to show that the method is convergent with probability 1 to stationary points and recovers the subgradient and Lagrange multipliers that appear in necessary conditions of optimality.

Original languageEnglish (US)
Pages (from-to)32-49
Number of pages18
JournalMathematics of Operations Research
Volume12
Issue number1
DOIs
StatePublished - 1987
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'LINEARIZATION METHOD FOR NONSMOOTH STOCHASTIC PROGRAMMING PROBLEMS.'. Together they form a unique fingerprint.

Cite this