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.

N� de ref. del art�culo 9783836478601

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: A Coordinate Gradient Descent Method for Structured Nonsmooth Optimization : Theory and Applications
Editor: VDM Verlag Dr. M�ller E.K.
Fecha de publicaci�n: 2010
Idioma: Ingl�s
ISBN 10: 3836478609
ISBN 13: 9783836478601
Encuadernaci�n: Taschenbuch
Estado: Neu

Acerca de

Sinopsis

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.

Acerca del 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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Das Unternehmen AHA-BUCH GmbH: Seit der Gr�ndung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisg�nstig wie m�glich ihren B�cherwunsch zu erf�llen. Unsere Firma besch�ftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine W�nsche! Auf �ber 3700 m2 Fl�che haben wir �ber 100.000 B�cher, Modernes Antiquariat und Spiele auf Lager.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

AHA-BUCH GmbH
Garlebsen 48, Einbeck, 37574, Germany

Condiciones de venta y env�o

Condiciones de venta

T�rminos y Condiciones Generales e Informaci�n del Cliente / Pol�tica de Privacidad

I. T�rminos y Condiciones Generales

� 1 Disposiciones b�sicas

(1)Los siguientes t�rminos y condiciones se aplican a todos los contratos que celebre con nosotros como proveedor (AHA-BUCH GmbH) a trav�s de las plataformas de Internet AbeBooks y/o ZVAB. A menos que se acuerde lo contrario, se objetar� la inclusi�n de cualquiera de sus propios t�rminos y condiciones utilizados por usted.
(2)Un consumidor en el sentid...

M�s informaci�n

Condiciones de env�o

Enviamos su pedido despu�s de recibirlos
para art�culos disponibles las �ltimas 24 horas,
para art�culos con suministro nocturno a m�s tardar 48 horas.
En caso de que necesitemos pedir un art�culo a nuestro proveedor, nuestro tiempo de env�o depende de la fecha de recepci�n de los art�culos, pero los art�culos se enviar�n el mismo d�a.

Nuestro objetivo es enviar los art�culos pedidos de la manera m�s r�pida, pero tambi�n m�s eficiente y segura a nuestros clientes.

Informaci�n detallada sobre el vendedor