 | Monter d'un niveau |
Amaioua, N., Audet, C., Conn, A. R., & Le Digabel, S. (2018). Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm. European Journal of Operational Research, 268(1), 13-24. Lien externe
Audet, C., Conn, A. R., Le Digabel, S., & Peyrega, M. (2018). A progressive barrier derivative-free trust-region algorithm for constrained optimization. Computational Optimization and Applications, 71(2), 307-329. Lien externe
Amaioua, N., Le Digabel, S., Audet, C., & Conn, A. R. (juin 2016). Efficient solution of quadratically constrained quadratic subproblems within a direct-search algorithm [Affiche]. Workshop on Nonlinear Optimization Algorithms and Industrial Applications, Toronto, Ontario. Non disponible
Bonami, P., Biegler, L. T., Conn, A. R., Cornuejols, G., Grossmann, I. E., Laird, C. D., Lee, J., Lodi, A., Margot, F., Sawaya, N., & Wachter, A. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2), 186-204. Lien externe
Conn, A. R., & Le Digabel, S. (2013). Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optimization Methods and Software, 28(1), 139-158. Lien externe
Conn, A. R., Gould, N. I. M., Orban, D., & Toint, P. L. (2000). A primal-dual trust-region algorithm for non-convex nonlinear programming. Mathematical Programming, 87(2), 215-249. Lien externe
