Applications of interval arithmetic in non-smooth global optimization

DOI10.1016/S0096-3003(02)00417-4zbMath1030.65067OpenAlexW2089746719MaRDI QIDQ1405071

Yan-Jun Wang, Pei-Ping Shen, Ke-Cun Zhang

Publication date: 25 August 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00417-4

zbMATH Keywords

global optimizationbranch-and-bound algorithmnumerical examplesinterval arithmeticnon-smooth functionglobal minimumslopesminimum pointspruning test

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items

The approximation algorithm for solving a sort of non-smooth programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On interval enclosures using slope arithmetic
• Computing a global optimal solution to a design centering problem
• Cord-slope form of Taylor's expansion in univariate global optimization
• An interval algorithm for nondifferentiable global optimization
• Use of interval slopes for the irrational part of factorable functions
• Introduction to global optimization
• Interval Slopes for Rational Functions and Associated Centered Forms
• Bounding the Solution of Interval Linear Equations