Some feasibility sampling procedures in interval methods for constrained global optimization

DOI10.1007/s10898-015-0362-8zbMath1359.90110OpenAlexW2176447776MaRDI QIDQ506473

Min Sun, Mengyi Ying

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

zbMATH Keywords

linear constraintsinterval methodfeasible sampling

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval branch and bound with local sampling for constrained global optimization
• Linear and nonlinear programming.
• Deterministic global optimization. Theory, methods and applications
• Rigorous verification of feasibility
• Affine arithmetic: concepts and applications
• Stochastic global optimization.
• Abstract Generalized Bisection and a Cost Bound
• An Introduction to Affine Arithmetic
• Introduction to global optimization.

This page was built for publication: Some feasibility sampling procedures in interval methods for constrained global optimization