Using regularization and second order information in outer approximation for convex MINLP
DOI10.1007/S10107-018-1356-3zbMATH Open1461.65168OpenAlexW2904818131WikidataQ128724148 ScholiaQ128724148MaRDI QIDQ2297649FDOQ2297649
Authors: Jan Kronqvist, David E. Bernal, Ignacio E. Grossmann 
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
Recommendations
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Regularized optimization methods for convex MINLP problems
- An outer approximation method for a class of minimax convex MINLP problems
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Title not available (Why is that?)
- Mixed-integer nonlinear optimization
- Benchmarking optimization software with performance profiles.
- Introductory lectures on convex optimization. A basic course.
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- 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
- New variants of bundle methods
- Generalized Benders decomposition
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- A duality theorem for non-linear programming
- A tree-search algorithm for mixed integer programming problems
- Deterministic global optimization in nonlinear optimal control problems
- A logarithmic barrier cutting plane method for convex programming
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Introduction to nonsmooth optimization. Theory, practice and software
- 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
- Prices stabilization for inexact unit-commitment problems
Cited In (13)
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A proximal-point outer approximation algorithm
- Sparse convex optimization toolkit: a mixed-integer framework
- The supporting hyperplane optimization toolkit for convex MINLP
- A disjunctive cut strengthening technique for convex MINLP
- Partially distributed outer approximation
- An outer-approximation algorithm for maximum-entropy sampling
- Daily scheduling of generating units with natural-gas market constraints
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Outer approximation for mixed-integer nonlinear robust optimization
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Regularized optimization methods for convex MINLP problems
Uses Software
This page was built for publication: Using regularization and second order information in outer approximation for convex MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297649)
