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

DOI10.1080/02331934.2013.796473zbMath1311.90083OpenAlexW2005435282MaRDI QIDQ4981878

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

Publication date: 20 March 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.796473

zbMATH Keywords

nonsmooth optimizationgeneralized convexitypseudoconvex functionsubgradientmixed-integer programmingextended cutting plane algorithm\(\alpha\)ECPnonsmooth MINLP

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27)

Related Items (6)

Using projected cutting planes in the extended cutting plane method ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm ⋮ Convex mixed integer nonlinear programming problems and an outer approximation algorithm ⋮ Outer approximation for mixed-integer nonlinear robust optimization

Cites Work

• Solving mixed integer nonlinear programs by outer approximation
• Generalized monotonicity and generalized convexity
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs

This page was built for publication: Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems