Journal of Machine Learning Research) ??-?? Submitted; Revised; PublishedEfficient Online and Batch Learning using Forward Backward Splitting

First Page		Document Content
Date: 2014-09-05 13:17:08 Mathematical optimization Convex analysis Convex optimization Subgradient method Gradient descent Lipschitz continuity Subderivative Support vector machine		Journal of Machine Learning Research) ??-?? Submitted; Revised; PublishedEfficient Online and Batch Learning using Forward Backward Splitting Add to Reading List Source URL: stanford.edu Download Document from Source Website File Size: 573,44 KB Share Document on Facebook

	Generalized Convexity and Nonsmooth Optimization Diethard Pallaschke Contents of the lecture: 1 Convexity 1.1 Convexity in infinite-dimensionalSpaces 1.2 DC-Functions DocID: 1qvFs - View Document
	HVX: Disciplined Convex Programming and Symbolic Subdifferentiation in Haskell Chris Copeland 1 DocID: 1pqhm - View Document
	Journal of Machine Learning Research) ??-?? Submitted; Revised; PublishedEfficient Online and Batch Learning using Forward Backward Splitting DocID: 1pimU - View Document
	277 Documenta Math. Subgradient Optimization in Nonsmooth Optimization DocID: 1oUrq - View Document
	Noname manuscript No. (will be inserted by the editor) An optimal subgradient algorithm with subspace search for costly convex optimization problems Masoud Ahookhosh · Arnold Neumaier DocID: 18kVi - View Document