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

DOI10.1007/S10898-017-0528-7MaRDI QIDQ1679493zbMATH OpenOpenAlexWikidataFDO

Authors Ville-Pekka Eronen, Jan Kronqvist, Tapio Westerlund, Marko M. Mäkelä, N. 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

convex optimizationnonsmooth optimizationMINLPClarke subdifferentialgeneralized convexitiesextended supporting hyperplane method

Mathematics Subject Classification ID

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

Recommendations

• On solving generalized convex MINLP problems using supporting hyperplane techniques
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
• On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
• Convex mixed integer nonlinear programming problems and an outer approximation algorithm

Cites work

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

Cited in

(10)

• scientific article; zbMATH DE number 5735028 (Why is no real title available?)
• Using projected cutting planes in the extended cutting plane method
• On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
• Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
• Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
• A disjunctive cut strengthening technique for convex MINLP
• On solving generalized convex MINLP problems using supporting hyperplane techniques
• Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
• scientific article; zbMATH DE number 786571 (Why is no real title available?)
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems

Describes a project that uses

Uses Software

• AlphaECP
• FEASPUMP

This page was built for publication: Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679493)