Derivative-free optimization methods for finite minimax problems

Optimization Methods and Software

Volumn 28, Issue 2, 2013, Pages 300-312

  Hare, Warren ^a   MacKlem, Mason ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

active manifold; active set; derivative free optimization; gradient sampling; optimization

Indexed keywords

ACTIVE MANIFOLD; ACTIVE SETS; ANALYTICAL KNOWLEDGE; DERIVATIVE-FREE METHODS; DERIVATIVE-FREE OPTIMIZATION; DESIGNING METHODS; GRADIENT DESCENT; GRADIENT SAMPLING; MINIMAX PROBLEM; NON-SMOOTH; NONCONVEX OPTIMIZATION; NUMERICAL TESTS; OPTIMIZATION PROBLEMS; OVERTON; RANDOM SAMPLING; SUBDIFFERENTIALS;

ALGORITHMS; OPTIMIZATION;

PROBLEM SOLVING;

EID: 84870926255     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2011.638923     Document Type: Article

References (33)

1. Al-Khayyal, F., and, Kyparisis, J. 1991. Finite convergence of algorithms for nonlinear programs and variational inequalities. J. Optim. Theory Appl, 70 (2): 319-332.
2. Audet, C., and, Dennis, J. E. Jr. 2002. Analysis of generalized pattern searches. SIAM J. Optim, 13 (3): 889-903. (electronic, 2003) (doi:10.1137/S1052623400378742)
3. Audet, C., and, Dennis, J. E. Jr. 2006. Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim, 17 (1): 188-217. (electronic) (doi:10.1137/040603371)
4. Bagirov, A. M. 2003. Continuous subdifferential approximations and their applications. J. Math. Sci. (New York), 115 (5): 2567-2609.
5. Bagirov, A. M., Karaszen, B., and, Sezer, M. 2008. Discrete gradient method: Derivative-free method for nonsmooth optimization. J. Optim. Theory Appl, 137 (2): 317-334.
6. Bogani, C., Gasparo, M. G., and, Papini, A. 2009. Generating set search methods for piecewise smooth problems. SIAM J. Optim, 20 (1): 321-335.
7. A.J. Booker, J.E. Dennis, Jr., P.D. Frank, D.B. Serafini, and V. Torczon, Optimization using surrogate objectives on a helicopter test example, in J. Borgaard, J. Burns and S. Schreck, editors, Computational Methods for Optimal Design and Control (Arlington, VA 1997), Progress in Systems and Control Theory Vol. 24, Birkhuser, Boston, MA, 1998, pp. 49-58
8. Bortz, D. M., and, Kelley, C. T. 1998. The simplex gradient and noisy optimization problems. In Computational Methods in Optimal Design and Control, Edited by: Borggaard, J. T., Burns, J., Cliff, E. and Schreck, S. 77-90. Basel: Birkhuser. Progress in Systems and Control Theory Vol. 24
9. Burke, J. V., and, Moré, J. J. 1988. On the identification of active constraints. SIAM J. Numer. Anal, 25 (5): 1197-1211.
10. Burke, J. V., Lewis, A. S., and, Overton, M. L. 2002. Approximating subdifferentials by random sampling of gradients. Math. Oper. Res, 27 (3): 567-584.
11. Burke, J. V., Lewis, A. S., and, Overton, M. L. 2005. A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim, 15 (3): 751-779. (electronic) (doi:10.1137/030601296)
12. Clarke, F. H. 1983. Optimization and Nonsmooth Analysis, New York: Wiley. reprinted by SIAM, 1983
13. Conn, A. R., Scheinberg, K., and, Vicente, L. N. 2009. Introduction to Derivative-Free Optimization, Vol. 8, Philadelphia, PA: SIAM. MPS/SIAM Series on Optimization
14. Custódio, A. L., and, Vicente, L. N. 2007. Using sampling and simplex derivatives in pattern search methods. SIAM J. Optim, 18 (2): 537-555.
15. Custódio, A. L., Dennis, J. E. Jr., and, Vicente, L. N. 2008. Using simplex gradients of nonsmooth functions in direct search methods. IMA J. Numer. Anal, 28 (4): 770-784.
16. Daniilidis, A., Hare, W., and, Malick, J. 2006. Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems. Optimization, 55 (5-6): 481-503.
17. Duvigneau, R., and, Visonneau, M. 2004. Hydrodynamic design using a derivative-free method. Struct. Multidiscip. Optim, 28: 195-205. 10.1007/s00158-004-0414-z (doi:10.1007/s00158-004-0414-z)
18. Gupal, A. M. 1977. A method for the minimization of almost differentiable functions. Kibernetika (Kiev), 1: 114-116.
19. Hare, W. L. 2009. A proximal method for identifying active manifolds. Comput. Optim. Appl, 43 (2): 295-306.
20. Hare, W. L. 2010. Using derivative free optimization for constrained parameter selection in a home and community care forecasting model. In International Perspectives on Operations Research and Health Care Edited by: Blake, J. and Carter, M. 61-73. Toronto. Proceedings of the 34th Meeting of the EURO Working Group on Operational Research Applied to Health Sciences
21. Hare, W. L., and, Lewis, A. S. 2004. Identifying active constraints via partial smoothness and prox-regularity. J. Convex Anal, 11 (2): 251-266.
22. Hare, W. L., and, Lewis, A. S. 2007. Identifying active manifolds. Algorithmic Oper. Res, 2 (2): 75-82.
23. Kiwiel, K. C. 2010. A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim, 20 (4): 1983-1994.
24. Kolda, T. G., Lewis, R. M., and, Torczon, V. 2003. Optimization by direct search: New perspectives on some classical and modern methods. SIAM Rev, 45 (3): 385-482.
25. Kolda, T. G., Lewis, R. M., and, Torczon, V. 2006. Stationarity results for generating set search for linearly constrained optimization. SIAM J. Optim, 17 (4): 943-968.
26. Liuzzi, G., Lucidi, S., and, Sciandrone, M. 2006. A derivative-free algorithm for linearly constrained finite minimax problems. SIAM J. Optim, 16 (4): 1054-1075.
27. L. Lukan and J. Vlek, Test problems for nonsmooth unconstrained and linearly constrained optimization, Tech. Rep. 798, Academy of Sciences of the Czech Republic, 2000. Available at http://www3.cs.cas.cz/research/library/ reports-700.shtml
28. Marsden, A. L., Feinstein, J. A., and, Taylor, C. A. 2008. A computational framework for derivative-free optimization of cardiovascular geometries. Comput. Methods Appl. Mech. Eng, 197 (21-24): 1890-1905.
29. Mifflin, R., and, Sagastizábal, C. 2002. Proximal points are on the fast track. J. Convex Anal, 9 (2): 563-579. Special issue on optimization (Montpellier, 2000)
30. Mifflin, R., and, Sagastizábal, C. 2005. A VU-algorithm for convex minimization. Math. Program, 104 (2-3, Series B): 583-608.
31. Marsden, A. L., Wang, M., Dennis, J. E. Jr., and, Moin, P. 2007. Trailing-edge noise reduction using derivative-free optimization and large-eddy simulation. J. Fluid Mech, 572: 13-36.
32. Wright, S. J. 1993. Identifiable surfaces in constrained optimization. SIAM J. Control Optim, 31 (4): 1063-1079.
33. Wright, S. J. 2010. Accelerated block-coordinate relaxation for regularized optimization. Tech. Rep,. Available at http://www.optimization- online.org/DB-HTML/2010/08/2702.html