Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Feasible direction methods for stochastic programming problems (1980)
    Springer
    Mathematical programming 19 (1980), S. 220-229 
    Details
    ISSN: 1436-4646
    Keywords: Stochastic Programming ; Feasible Direction Methods ; Point-to-Set Maps ; Convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A unified approach to stochastic feasible direction methods is developed. An abstract point-to-set map description of the algorithm is used and a general convergence theorem is proved. The theory is used to develop stochastic analogs of classical feasible direction algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581643
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...