Using regularization and second order information in outer approximation for convex MINLP
From MaRDI portal
Publication:2297649
DOI10.1007/s10107-018-1356-3zbMath1461.65168OpenAlexW2904818131WikidataQ128724148 ScholiaQ128724148MaRDI QIDQ2297649
David E. Bernal, Ignacio E. Grossmann, Jan Kronqvist
Publication date: 20 February 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1356-3
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, A disjunctive cut strengthening technique for convex MINLP, The supporting hyperplane optimization toolkit for convex MINLP, Two linear approximation algorithms for convex mixed integer nonlinear programming, Sparse convex optimization toolkit: a mixed-integer framework, Daily scheduling of generating units with natural-gas market constraints, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, An outer-approximation algorithm for maximum-entropy sampling, A proximal-point outer approximation algorithm, Partially distributed outer approximation, Alternative regularizations for outer-approximation algorithms for convex MINLP, Outer approximation for mixed-integer nonlinear robust optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Regularized optimization methods for convex MINLP problems
- Reformulations for utilizing separability when solving convex MINLP problems
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Introductory lectures on convex optimization. A basic course.
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- A logarithmic barrier cutting plane method for convex programming
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- Prices stabilization for inexact unit-commitment problems
- Introduction to Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A duality theorem for non-linear programming
- Mixed-integer nonlinear optimization
- A tree-search algorithm for mixed integer programming problems
- Deterministic global optimization in nonlinear optimal control problems
- Benchmarking optimization software with performance profiles.
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
