A randomized method for smooth convex minimization, motivated by probability maximization
Csaba I Fabian (fabian.csabagamf.kefo.hu)
Abstract: We propose a randomized gradient method - or a randomized cutting-plane method from a dual viewpoint. From the primal viewpoint, our method bears a resemblance to the stochastic approximation family. But in contrast to stochastic approximation, the present method builds a model problem.
Keywords: Convex optimization, stochastic optimization, probabilistic problems
Category 1: Stochastic Programming
Category 2: Nonlinear Optimization
Citation: Kecskemet College, Pallasz Athene University. Izsaki ut 10, 6000 Kecskemet, Hungary; and Budapest University of Technology and Economics. Muegyetem rkp 3-9, 1111 Budapest, Hungary.
Entry Submitted: 03/24/2017
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|