A trust-region-based derivative free algorithm for mixed integer programming
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
Volume (Year): 60 (2015)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/math/journal/10589|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- G. Liuzzi & S. Lucidi & F. Rinaldi, 2012. "Derivative-free methods for bound constrained mixed-integer optimization," Computational Optimization and Applications, Springer, vol. 53(2), pages 505-526, October.
- Sriver, Todd A. & Chrissis, James W. & Abramson, Mark A., 2009. "Pattern search ranking and selection algorithms for mixed variable simulation-based optimization," European Journal of Operational Research, Elsevier, vol. 198(3), pages 878-890, November.
- A. Custódio & H. Rocha & L. Vicente, 2010. "Incorporating minimum Frobenius norm models in direct search," Computational Optimization and Applications, Springer, vol. 46(2), pages 265-278, June.
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:60:y:2015:i:1:p:199-229. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.