Alternative regularizations for outer-approximation algorithms for convex MINLP
From MaRDI portal
Publication:2089881
DOI10.1007/s10898-022-01178-4zbMath1505.90082OpenAlexW4283753070MaRDI QIDQ2089881
Zedong Peng, Jan Kronqvist, David E. Bernal, Ignacio E. Grossmann
Publication date: 24 October 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01178-4
Related Items
Fill‐rate service level constrained distribution network design, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Mathematical programming: Turing completeness and applications to software analysis
- Regularized optimization methods for convex MINLP problems
- Reformulations for utilizing separability when solving convex MINLP problems
- 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.
- A hybrid LP/NLP paradigm for global optimization relaxations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- 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
- The supporting hyperplane optimization toolkit for convex MINLP
- Outer approximation with conic certificates for mixed-integer convex problems
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Using regularization and second order information in outer approximation for convex MINLP
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Introduction to Nonsmooth Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Trust Region Methods
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- A tree-search algorithm for mixed integer programming problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Pyomo -- optimization modeling in Python
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
