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

ISSN： 0025-5610

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

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

Convex Nondifferentiable Optimization: A Survey Focused on the Analytic Center Cutting Plane Method

By Goffin Jean-Louis Vial Jean-Philippe

Optimization Methods and Software, Vol. 17, Iss. 5, 2002-01 ,pp. : 805-867

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm

By Still Claus Westerlund Tapio

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 63-83

Springer Publishing Company

Access to resources Recommend Favorite

A memory gradient method for non-smooth convex optimization

By Ou Yigui Liu Yuanwen

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization

By Karmitsa Napsu Tanaka Filho Mario Herskovits José

Journal of Optimization Theory and Applications, Vol. 148, Iss. 3, 2011-03 ,pp. : 528-549

Springer Publishing Company

Access to resources Recommend Favorite

Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems

Optimization, Vol. 64, Iss. 3, 2015-03 ,pp. : 641-661

Taylor & Francis Ltd

Access to resources Recommend Favorite