Lipschitz continuity and the termination of interval methods for global optimization

DOI10.1016/S0898-1221(01)00219-XMaRDI QIDQ5948880zbMATH OpenFDO

Authors András Erik Csallner

Publication date 12 November 2001

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

Full work available at URL https://doi.org/10.1016/S0898-1221(01)00219-X

zbMATH Keywords

global optimizationHansen methodinterval arithmeticinterval subdivisionMoore-Skelboe methods

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 757681
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• scientific article; zbMATH DE number 2145268
• On using estimates of Lipschitz constants in global optimization
• An algorithm for global optimization of Lipschitz continuous functions

Cites work

• A heuristic rejection criterion in interval global optimization algorithms
• Bounding the Solution of Interval Linear Equations
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• scientific article; zbMATH DE number 757686 (Why is no real title available?)
• scientific article; zbMATH DE number 815479 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Rigorous global search: continuous problems
• The convergence speed of interval methods for global optimization

Cited in

(6)

• Lipschitz continuity of the -subdifferential and nonmonotonic methods with averaging of -subgradients for nonsmooth optimization
• Optimality and duality for second-order interval-valued variational problems
• scientific article; zbMATH DE number 2068082 (Why is no real title available?)
• Interval branch and bound with local sampling for constrained global optimization
• The approximation algorithm for solving a sort of non-smooth programming
• A fast memoryless interval-based algorithm for global optimization

Describes a project that uses

Uses Software

• INTOPT_90

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

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