An algorithm for approximating piecewise linear concave functions from sample gradients (Q1870009): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact subgradient methods with applications in stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferential Convergence in Stochastic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of some methods for minimizing a nonsmooth convex function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse / rank
 
Normal rank

Latest revision as of 15:42, 5 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for approximating piecewise linear concave functions from sample gradients
scientific article

    Statements

    Identifiers