Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm

Author： Still Claus   Westerlund Tapio  

Publisher： Springer Publishing Company

ISSN： 0926-6003

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

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

Cutting plane algorithms for robust conic convex optimization problems

By Gomez J.   Gomez W.  

Optimization Methods and Software, Vol. 21, Iss. 5, 2006-10 ,pp. : 779-803

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By  

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

Taylor & Francis Ltd

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

An algorithm to solve polyhedral convex set optimization problems

By Schrage Carola  

Optimization, Vol. 62, Iss. 1, 2013-01 ,pp. : 131-141

Taylor & Francis Ltd

Access to resources Recommend Favorite

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