Convex mixed integer nonlinear programming problems and an outer approximation algorithm
From MaRDI portal
Publication:746812
DOI10.1007/s10898-015-0284-5zbMath1327.90144arXiv1502.06315OpenAlexW3104448045WikidataQ57931883 ScholiaQ57931883MaRDI QIDQ746812
Publication date: 20 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06315
Related Items
Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, Outer-approximation algorithms for nonsmooth convex MINLP problems, Outer approximation for mixed-integer nonlinear robust optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition in general mathematical programming
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- An algorithmic framework for convex mixed integer nonlinear programs
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Convex functions, monotone operators and differentiability
- Solving mixed integer nonlinear programs by outer approximation
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Generalized Benders decomposition
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- Set-valued analysis
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
