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

Publisher： Taylor & Francis Ltd

E-ISSN： 1029-4945|64|3|641-661

ISSN： 0233-1934

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

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

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

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 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

Subgradient Method for Nonconvex Nonsmooth Optimization

By Bagirov A.  

Journal of Optimization Theory and Applications, Vol. 157, Iss. 2, 2013-05 ,pp. : 416-435

Springer Publishing Company

Access to resources Recommend Favorite

On the generalization of ECP and OA methods to nonsmooth convex MINLP problems

By Eronen Ville-Pekka   Mäkelä Marko M.   Westerlund Tapio  

Optimization, Vol. 63, Iss. 7, 2014-07 ,pp. : 1057-1073

Taylor & Francis Ltd

Access to resources Recommend Favorite