Lipschitz continuity and the termination of interval methods for global optimization

DOI10.1016/S0898-1221(01)00219-XzbMath0983.65075MaRDI QIDQ5948880

András Erik Csallner

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

global optimizationinterval arithmeticHansen methodinterval subdivisionMoore-Skelboe methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) General methods in interval analysis (65G40)

Related Items (4)

The approximation algorithm for solving a sort of non-smooth programming ⋮ A fast memoryless interval-based algorithm for global optimization ⋮ Optimality and duality for second-order interval-valued variational problems ⋮ Interval branch and bound with local sampling for constrained global optimization

Uses Software

• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigorous global search: continuous problems
• The convergence speed of interval methods for global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• Bounding the Solution of Interval Linear Equations
• A heuristic rejection criterion in interval global optimization algorithms

This page was built for publication: Lipschitz continuity and the termination of interval methods for global optimization