\textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
From MaRDI portal
Publication:2022241
DOI10.1007/s10898-020-00878-zzbMath1465.90079OpenAlexW3002926528MaRDI QIDQ2022241
Ignacio J. Araya, Victor Reyes
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00878-z
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Upper bounding in inner regions for global optimization under inequality constraints
- A reliable affine relaxation method for global optimization
- Rigorous global search: continuous problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- BARON: A general purpose global optimization software package
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Recent advances in trust region algorithms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- ICOS: a branch and bound based solver for rigorous global optimization
- Constructive Interval Disjunction
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
- CONOPT—A Large-Scale GRG Code
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Benchmarking optimization software with performance profiles.
This page was built for publication: \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
