An interval arithmetic method for global optimization
From MaRDI portal
Publication:1256301
DOI10.1007/BF02252616zbMath0403.65028OpenAlexW1496983606MaRDI QIDQ1256301
Publication date: 1979
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02252616
Newton's MethodGlobal OptimizationInterval ArithmeticConstrained OptimizationLagrange-Multiplier Technique
Related Items (17)
An interval branch and bound algorithm for global optimization of a multiperiod pricing model ⋮ An interval global optimization algorithm for a class of functions with several variables ⋮ Computable error bounds for an optimization problem with parallelepiped constraint ⋮ An efficient interval computing technique for bound-constrained uncertain optimization problems ⋮ Interval methods for global optimization ⋮ Heuristic rejection in interval global optimization ⋮ An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming ⋮ On constrained optimization by interval arithmetic and interval order relations ⋮ Unnamed Item ⋮ Interval constraint programming for globally solving catalog-based categorical optimization ⋮ A local exploration-based differential evolution algorithm for constrained global optimization ⋮ Nonlinear equations and optimization ⋮ The impact of accelerating tools on the interval subdivision algorithm for global optimization ⋮ A hybrid global optimization method: The multi-dimensional case ⋮ A hybrid global optimization method: The one-dimensional case ⋮ Interval tools for global optimization ⋮ A priority measure in interval methods for constrained global optimization
Cites Work
This page was built for publication: An interval arithmetic method for global optimization