首页 | 本学科首页   官方微博 | 高级检索  
     检索      


An algorithm for approximating piecewise linear concave functions from sample gradients
Authors:Huseyin TopalogluWarren B Powell
Institution:Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544, USA
Abstract:An effective algorithm for solving stochastic resource allocation problems is to build piecewise linear, concave approximations of the recourse function based on sample gradient information. Algorithms based on this approach are proving useful in application areas such as the newsvendor problem, physical distribution and fleet management. These algorithms require the adaptive estimation of the approximations of the recourse function that maintain concavity at every iteration. In this paper, we prove convergence for a particular version of an algorithm that produces approximations from stochastic gradient information while maintaining concavity.
Keywords:Stochastic gradient methods  Approximation  Almost sure convergence  Concave functions
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号