Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems

DOI10.1007/s10898-017-0528-7zbMath1373.90082OpenAlexW2611155867WikidataQ109595612 ScholiaQ109595612MaRDI QIDQ1679493

Ville-Pekka Eronen, Marko M. Mäkelä, Tapio Westerlund, Jan Kronqvist, Napsu Karmitsa

Publication date: 9 November 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0528-7

zbMATH Keywords

nonsmooth optimizationconvex optimizationClarke subdifferentialMINLPgeneralized convexitiesextended supporting hyperplane method

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items

A disjunctive cut strengthening technique for convex MINLP ⋮ Using projected cutting planes in the extended cutting plane method ⋮ On solving generalized convex MINLP problems using supporting hyperplane techniques ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm

Uses Software

• FEASPUMP
• AlphaECP

Cites Work

• Regularized optimization methods for convex MINLP problems
• A feasibility pump for mixed integer nonlinear programs
• Optimal facility layout design
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• Introduction to Nonsmooth Optimization
• Optimization and nonsmooth analysis
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
• The Supporting Hyperplane Method for Unimodal Programming
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
• Unnamed Item