A memory gradient method for non-smooth convex optimization

E-ISSN： 1029-0265|92|8|1625-1642

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.92, Iss.8, 2015-08, pp. : 1625-1642

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An adaptive gradient sampling algorithm for non-smooth optimization

By Curtis Frank E. Que Xiaocun

Optimization Methods and Software, Vol. 28, Iss. 6, 2013-12 ,pp. : 1302-1324

Taylor & Francis Ltd

Access to resources Recommend Favorite

Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization

By Karmitsa N.

Optimization, Vol. 61, Iss. 12, 2012-12 ,pp. : 1491-1509

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Non-Smooth Band around a Non-Convex Region

By Aarão J. Cox A. Jones C. Martelli M. Westfahl A.

The College Mathematics Journal, Vol. 37, Iss. 4, 2006-09 ,pp. : 269-278

Mathematical Association of America

Access to resources Recommend Favorite

A proximal cutting plane method using Chebychev center for nonsmooth convex optimization

By Ouorou Adam

Mathematical Programming, Vol. 119, Iss. 2, 2009-07 ,pp. : 239-271

Springer Publishing Company

Access to resources Recommend Favorite

Globally Convergent BFGS Method for Nonsmooth Convex Optimization1

By Rauf A.I. Fukushima M.

Journal of Optimization Theory and Applications, Vol. 104, Iss. 3, 2000-03 ,pp. : 539-558

Springer Publishing Company

Access to resources Recommend Favorite