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

Author： Eronen Ville-Pekka Mäkelä Marko M. Westerlund Tapio

ISSN： 0233-1934

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

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

Related content

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

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 differential inclusion-based approach for solving nonsmooth convex optimization problems

By Hosseini Alireza

Optimization, Vol. 62, Iss. 9, 2013-09 ,pp. : 1203-1226

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximate Efficiency and Scalar Stationarity in Unbounded Nonsmooth Convex Vector Optimization Problems

By BOLINTINÉANU S.

Journal of Optimization Theory and Applications, Vol. 106, Iss. 2, 2000-08 ,pp. : 265-296

Springer Publishing Company

Access to resources Recommend Favorite

Spectral Element Methods for Elliptic Problems in Nonsmooth Domains

By Pathria D. Karniadakis G.E.

Journal of Computational Physics, Vol. 122, Iss. 1, 1995-11 ,pp. : 83-95

Academic Press

Access to resources Recommend Favorite