Interval method for bounding level sets: Revisited and tested with global optimization problems

DOI10.1007/BF01933213zbMath0726.65069OpenAlexW1978511260MaRDI QIDQ804239

Tibor Csendes

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933213

zbMATH Keywords

algorithmglobal optimizationinterval arithmetictest problemsinclusion functionbounds for level sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items (4)

Constructing large feasible suboptimal intervals for constrained nonlinear optimization ⋮ A new interval method for locating the boundary of level sets ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ The impact of accelerating tools on the interval subdivision algorithm for global optimization

Cites Work

• Extended univariate algorithms for \(n\)-dimensional global optimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Inclusion functions and global optimization. II
• An interval method for bounding level sets of parameter estimation problems
• Global optimization using interval analysis - the multi-dimensional case
• Inclusion functions and global optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interval method for bounding level sets: Revisited and tested with global optimization problems