Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability

DOI10.1007/s10957-015-0715-yzbMath1327.90145WikidataQ57931888 ScholiaQ57931888MaRDI QIDQ896190

Zhou Wei, M. Montaz Ali

Publication date: 14 December 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0715-y

zbMATH Keywords

outer approximation; subgradient; nonlinear program; MINLP

Mathematics Subject Classification ID

90C25: Convex programming

90C11: Mixed integer programming

90C30: Nonlinear programming

Related Items

Nonconvex sensitivity-based generalized Benders decomposition, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, Using regularization and second order information in outer approximation for convex MINLP, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint

Uses Software

• Bonmin

Cites Work

• An algorithmic framework for convex mixed integer nonlinear programs
• Solving mixed integer nonlinear programs by outer approximation
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Generalized Benders decomposition
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• Unnamed Item