Verwandte Artikel zu A Coordinate Gradient Descent Method for Structured...
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization: Theory and Applications - Softcover
Inhaltsangabe
Nonsmooth optimization problems are generally considered to be more difficult than smooth problems. Yet, there is an important class of nonsmooth problems that lie in between. In this book, we consider the problem of minimizing the sum of a smooth function and a (block separable) convex function with or without linear constraints. This problem includes as special cases bound-constrained optimization, smooth optimization with L_1-regularization, and linearly constrained smooth optimization such as a large-scale quadratic programming problem arising in the training of support vector machines. We propose a block coordinate gradient descent method for solving this class of structured nonsmooth problems. The method is simple, highly parallelizable, and suited for large-scale applications in signal/image denoising, regression, and data mining/classification. We establish global convergence and, under a local Lipschitzian error bound assumption, local linear rate of convergence for this method. Our numerical experiences suggest that our method is effective in practice. This book is helpful to the people who are interested in solving large-scale optimization problems.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
Sangwoon Yun: PhD in Mathematics at University of Washington. Research interest: Convex and nonsmooth optimization, variational analysis. Research Fellow at National University of Singapore.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 39,24
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für A Coordinate Gradient Descent Method for Structured...
Foto des Verkäufers
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Verlag:
VDM Verlag Dr. Müller, 2010
ISBN 10: 3836478609
ISBN 13: 9783836478601
Neu
Kartoniert / Broschiert
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Yun SangwoonSangwoon Yun: PhD in Mathematics at University of Washington. Research interest: Convex and nonsmooth optimization, variational analysis. Research Fellow at National University of Singapore.Nonsmooth optimization pr. Bestandsnummer des Verkäufers 5388240
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Verlag:
VDM Verlag Dr. Müller E.K. Nov 2012, 2012
ISBN 10: 3836478609
ISBN 13: 9783836478601
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -Nonsmooth optimization problems are generally considered to be more difficult than smooth problems. Yet, there is an important class of nonsmooth problems that lie in between. In this book, we consider the problem of minimizing the sum of a smooth function and a (block separable) convex function with or without linear constraints. This problem includes as special cases bound-constrained optimization, smooth optimization with L_1-regularization, and linearly constrained smooth optimization such as a large-scale quadratic programming problem arising in the training of support vector machines. We propose a block coordinate gradient descent method for solving this class of structured nonsmooth problems. The method is simple, highly parallelizable, and suited for large-scale applications in signal/image denoising, regression, and data mining/classification. We establish global convergence and, under a local Lipschitzian error bound assumption, local linear rate of convergence for this method. Our numerical experiences suggest that our method is effective in practice. This book is helpful to the people who are interested in solving large-scale optimization problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 112 pp. Englisch. Bestandsnummer des Verkäufers 9783836478601
Anzahl: 2 verfügbar
Foto des Verkäufers
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization : Theory and Applications
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Nonsmooth optimization problems are generally considered to be more difficult than smooth problems. Yet, there is an important class of nonsmooth problems that lie in between. In this book, we consider the problem of minimizing the sum of a smooth function and a (block separable) convex function with or without linear constraints. This problem includes as special cases bound-constrained optimization, smooth optimization with L_1-regularization, and linearly constrained smooth optimization such as a large-scale quadratic programming problem arising in the training of support vector machines. We propose a block coordinate gradient descent method for solving this class of structured nonsmooth problems. The method is simple, highly parallelizable, and suited for large-scale applications in signal/image denoising, regression, and data mining/classification. We establish global convergence and, under a local Lipschitzian error bound assumption, local linear rate of convergence for this method. Our numerical experiences suggest that our method is effective in practice. This book is helpful to the people who are interested in solving large-scale optimization problems. Bestandsnummer des Verkäufers 9783836478601
Anzahl: 1 verfügbar
Foto des Verkäufers
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Verlag:
VDM Verlag Dr. Müller E.K. Nov 2012, 2012
ISBN 10: 3836478609
ISBN 13: 9783836478601
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Nonsmooth optimization problems are generally considered to be more difficult than smooth problems. Yet, there is an important class of nonsmooth problems that lie in between. In this book, we consider the problem of minimizing the sum of a smooth function and a (block separable) convex function with or without linear constraints. This problem includes as special cases bound-constrained optimization, smooth optimization with L_1-regularization, and linearly constrained smooth optimization such as a large-scale quadratic programming problem arising in the training of support vector machines. We propose a block coordinate gradient descent method for solving this class of structured nonsmooth problems. The method is simple, highly parallelizable, and suited for large-scale applications in signal/image denoising, regression, and data mining/classification. We establish global convergence and, under a local Lipschitzian error bound assumption, local linear rate of convergence for this method. Our numerical experiences suggest that our method is effective in practice. This book is helpful to the people who are interested in solving large-scale optimization problems. 112 pp. Englisch. Bestandsnummer des Verkäufers 9783836478601
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Brand New. 112 pages. 8.66x5.91x0.26 inches. In Stock. Bestandsnummer des Verkäufers 3836478609
Anzahl: 1 verfügbar