An interval algorithm for constrained global optimization

DOI10.1016/0377-0427(94)90331-XzbMath0809.65064MaRDI QIDQ1334802

Michael A. Wolfe

Publication date: 22 September 1994

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

zbMATH Keywords

interval arithmeticcomputational resultspenalty functionconstrained global optimizationnumerical experience

Mathematics Subject Classification ID

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

Related Items (8)

An interval algorithm for nondifferentiable global optimization ⋮ Interval methods for global optimization ⋮ Numerical solution for bounding feasible point sets ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ Efficient interval partitioning for constrained global optimization ⋮ A hybrid global optimization method: The multi-dimensional case ⋮ On proving existence of feasible points in equality constrained optimization problems ⋮ Interval mathematics, algebraic equations and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• On interval enclosures using slope arithmetic
• Augmentability in optimization theory

This page was built for publication: An interval algorithm for constrained global optimization