Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods

DOI10.1137/100793530zbMath1256.65057OpenAlexW2071453851MaRDI QIDQ3225235

Mihály Csaba Markót, Hermann Schichl

Publication date: 16 March 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100793530

zbMATH Keywords

classificationCOCONUTglobal optimizationinterval arithmeticlocal optimizationinterval branch-and-bound method\(k\)-nearest neighbor fitautomated solver selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items (3)

Algorithmic differentiation techniques for global optimization in the COCONUT environment ⋮ Bound constrained interval global optimization in the COCONUT environment ⋮ COCONUT

Uses Software

• KNITRO
• LOQO
• SNOPT
• Ipopt
• Boost Interval Arithmetic

This page was built for publication: Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods