Items related to A Coordinate Gradient Descent Method for Structured...
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization: Theory and Applications - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Sangwoon Yun: PhD in Mathematics at University of Washington. Research interest: Convex and nonsmooth optimization, variational analysis. Research Fellow at National University of Singapore.
"About this title" may belong to another edition of this title.
Buy New
View this item
£ 43.63
£ 9.51 shipping from Germany to United Kingdom
Destination, rates & speedsSearch results for A Coordinate Gradient Descent Method for Structured...
Seller Image
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Published by
VDM Verlag Dr. Müller E.K. Nov 2012, 2012
ISBN 10: 3836478609
ISBN 13: 9783836478601
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783836478601
Quantity: 2 available
Seller Image
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization : Theory and Applications
Published by
VDM Verlag Dr. Müller E.K., 2010
ISBN 10: 3836478609
ISBN 13: 9783836478601
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783836478601
Quantity: 1 available
Seller Image
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Published by
VDM Verlag Dr. Müller, 2010
ISBN 10: 3836478609
ISBN 13: 9783836478601
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Kartoniert / Broschiert. Condition: 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. Seller Inventory # 5388240
Quantity: Over 20 available
Seller Image
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Published by
VDM Verlag Dr. Müller E.K. Nov 2012, 2012
ISBN 10: 3836478609
ISBN 13: 9783836478601
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783836478601
Quantity: 2 available
Stock Image
A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization
Published by
Vdm Verlag Dr Mueller E K, 2008
ISBN 10: 3836478609
ISBN 13: 9783836478601
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 112 pages. 8.66x5.91x0.26 inches. In Stock. Seller Inventory # 3836478609
Quantity: 1 available