𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Tibor Csendes

Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
483 KB
Volume
30
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

General Further Discarding Tests in Geom
General Further Discarding Tests in Geometric Branch-and-Bound Methods for Non-Convex Multicriteria Optimization Problems
✍ Daniel Scholz πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 387 KB

## ABSTRACT Using a geometric branch‐and‐bound technique, my goal in this paper is to compute a sharp outer approximation of all Pareto‐optimal solutions in multicriteria optimization problems. To this end, I propose some general further discarding tests that are based on the Fritz John necessary c

Level Set Methods for Optimization Probl
Level Set Methods for Optimization Problems Involving Geometry and Constraints: I. Frequencies of a Two-Density Inhomogeneous Drum
✍ Stanley J. Osher; Fadil Santosa πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 544 KB

Many problems in engineering design involve optimizing the geometry to maximize a certain design objective. Geometrical constraints are often imposed. In this paper, we use the level set method devised in (Osher and Sethian, J. Comput. Phys. 79, 12 (1988)), the variational level set calculus present