A trust-region-based derivative free algorithm for mixed integer programming
Eric Newby () and
Majid Ali ()
Computational Optimization and Applications, 2015, vol. 60, issue 1, 199-229
A trust-region-based derivative free algorithm for solving bound constrained mixed integer nonlinear programs is developed in this paper. The algorithm is proven to converge to a local minimum after a finite number of function evaluations. In addition, an improved definition of local minima of mixed integer programs is proposed. Computational results showing the effectiveness of the derivative free algorithm are presented. Copyright Springer Science+Business Media New York 2015
Keywords: Mixed integer programming; Nonlinear programming; Derivative free algorithm; Trust region methods; 90C11; 90C30; 90C56 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:60:y:2015:i:1:p:199-229
Ordering information: This journal article can be ordered from
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().