Some feasibility sampling procedures in interval methods for constrained global optimization
From MaRDI portal
Publication:506473
DOI10.1007/S10898-015-0362-8zbMATH Open1359.90110OpenAlexW2176447776MaRDI QIDQ506473FDOQ506473
Authors: Mengyi Ying, M. Sun 
Publication date: 1 February 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0362-8
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
- Linear and nonlinear programming.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic global optimization. Theory, methods and applications
- Title not available (Why is that?)
- Introduction to global optimization.
- Rigorous verification of feasibility
- Interval branch and bound with local sampling for constrained global optimization
- Affine arithmetic: concepts and applications
- Stochastic global optimization.
- Abstract Generalized Bisection and a Cost Bound
- Title not available (Why is that?)
- An Introduction to Affine Arithmetic
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)
