Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees

Locatello, F.; Tschannen, M.; Rätsch, G.; Jaggi, M.

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2564837_10

DetailsSummary

Released

Conference Paper

Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees

MPS-Authors

/persons/resource/persons219928

Locatello, F.
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

External Resource

Link
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Locatello, F., Tschannen, M., Rätsch, G., & Jaggi, M. (2017). Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees. In I. Guyon, U. von Luxburg, & S. Bengio (Eds.), Advances in Neural Information Processing Systems 30 (pp. 773-784). Curran Associates, Inc. Retrieved from https://papers.nips.cc/paper/6679-greedy-algorithms-for-cone-constrained-optimization-with-convergence-guarantees.pdf.

Cite as: https://hdl.handle.net/21.11116/0000-0001-178F-5

Abstract

There is no abstract available