Interval method for bounding level sets: Revisited and tested with global optimization problems
From MaRDI portal
Publication:804239
DOI10.1007/BF01933213zbMATH Open0726.65069OpenAlexW1978511260MaRDI QIDQ804239FDOQ804239
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01933213
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Cites Work
- Global optimization using interval analysis - the multi-dimensional case
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Inclusion functions and global optimization. II
- Inclusion functions and global optimization
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Title not available (Why is that?)
- An interval method for bounding level sets of parameter estimation problems
Cited In (5)
- Mathematically rigorous global optimization in floating-point arithmetic
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Title not available (Why is that?)
- A new interval method for locating the boundary of level sets
Recommendations
- Title not available (Why is that?) π π
- A new interval method for locating the boundary of level sets π π
- An interval method for bounding level sets of parameter estimation problems π π
- Title not available (Why is that?) π π
- Level set methods for optimization problems involving geometry and constraints. II: Optimization over a fixed surface π π
- A modified integral-level set method for solving global optimization π π
- Level set methods: An overview and some recent results π π
- Level-set methods for convex optimization π π
- Level sets regularization with application to optimization problems π π
- A Level Set Method in Shape and Topology Optimization for Variational Inequalities π π
This page was built for publication: Interval method for bounding level sets: Revisited and tested with global optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804239)