Some feasibility sampling procedures in interval methods for constrained global optimization
From MaRDI portal
(Redirected from Publication:506473)
Recommendations
- Interval branch and bound with local sampling for constrained global optimization
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- New interval methods for constrained global optimization
- Interval tools for global optimization
- An interval algorithm for constrained global optimization
Cites work
- scientific article; zbMATH DE number 2130220 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 869737 (Why is no real title available?)
- Abstract Generalized Bisection and a Cost Bound
- Affine arithmetic: concepts and applications
- An Introduction to Affine Arithmetic
- Deterministic global optimization. Theory, methods and applications
- Interval branch and bound with local sampling for constrained global optimization
- Introduction to global optimization.
- Linear and nonlinear programming.
- Rigorous verification of feasibility
- Stochastic global optimization.
Cited in
(3)
This page was built for publication: Some feasibility sampling procedures in interval methods for constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506473)