scientific article; zbMATH DE number 869737
From MaRDI portal
Publication:4874513
zbMath0841.65049MaRDI QIDQ4874513
Publication date: 1 July 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (13)
Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems ⋮ Numerical solution for bounding feasible point sets ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ Some feasibility sampling procedures in interval methods for constrained global optimization ⋮ Exclusion regions for optimization problems ⋮ A fast memoryless interval-based algorithm for global optimization ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ A gentle introduction to Numerica ⋮ Credal networks ⋮ On proving existence of feasible points in equality constrained optimization problems ⋮ An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems ⋮ Interval analysis: Theory and applications ⋮ Interval branch and bound with local sampling for constrained global optimization
Uses Software
This page was built for publication:
