Some feasibility sampling procedures in interval methods for constrained global optimization

Mengyi Ying () and Min Sun ()
Additional contact information
Mengyi Ying: University of North Georgia
Min Sun: University of Alabama

Journal of Global Optimization, 2017, vol. 67, issue 1, No 18, 379-397

Abstract: Abstract Three feasibility sampling procedures are developed as add-on acceleration strategies in interval methods for solving global optimization problem over a bounded interval domain subject to one or two additional linear constraints. The main features of all three procedures are their abilities to quickly test any sub-domain’s feasibility and to actually locate a feasible point if the feasible set within the sub-domain is nonempty. This add-on feature of feasibility sampling can significantly lower upper bounds of the best objective function value in any interval method and improve its convergence and effectiveness.

Keywords: Interval method; Feasible sampling; Linear constraints (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-015-0362-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:67:y:2017:i:1:d:10.1007_s10898-015-0362-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-015-0362-8

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().