Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems

DOI10.1016/J.ORL.2025.107243MaRDI QIDQ6988116zbMATH OpenFDO

Authors Martina Kuchlbauer

Publication date 6 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2025.107243

zbMATH Keywords

outer approximationrobust optimizationgeneralized convexitybundle methodmixed-integer nonlinear optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47) Mixed integer programming (90C11) Robustness in mathematical programming (90C17)

Cites work

• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 1529036 (Why is no real title available?)
• scientific article; zbMATH DE number 3805870 (Why is no real title available?)
• A feasibility pump for mixed integer nonlinear programs
• Adaptive Bundle Methods for Nonlinear Robust Optimization
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Convex mixed integer nonlinear programming problems and an outer approximation algorithm
• Cutting-set methods for robust convex optimization with pessimizing oracles
• Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
• Deriving robust counterparts of nonlinear uncertain inequalities
• Exact methods for two-stage robust optimization with applications in gas networks
• Generalized Gradients and Applications
• Introduction to nonsmooth optimization. Theory, practice and software
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Nonconvex robust optimization for problems with constraints
• On mixed integer nonsmooth optimization
• On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
• Outer approximation for mixed-integer nonlinear robust optimization
• Outer-approximation algorithms for nonsmooth convex MINLP problems
• Regularized optimization methods for convex MINLP problems
• Solving mixed integer nonlinear programs by outer approximation
• Submonotone Subdifferentials of Lipschitz Functions
• Towards the solution of robust gas network optimization problems using the constrained active signature method
• Using regularization and second order information in outer approximation for convex MINLP

This page was built for publication: Outer approximation for generalized convex mixed-integer nonlinear robust optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988116)