A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization

SIAM Journal on Optimization

Volumn 20, Issue 4, 2010, Pages 1983-1994

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Averaged functions; Generalized gradient; Gradient sampling; Nonconvex; Nonsmooth optimization; Subgradient

Indexed keywords

GENERALIZED GRADIENTS; GRADIENT SAMPLING; NONCONVEX; NONSMOOTH OPTIMIZATION; SUBGRADIENT;

CONVERGENCE OF NUMERICAL METHODS; LEARNING ALGORITHMS;

OPTIMIZATION;

EID: 77951279520     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/090748408     Document Type: Article

References (21)

1. M. A. Abramson, C. Audet, J. E. Dennis, Jr., and S. Le Digabel, OrthoMADS: A deterministic MADS instance with orthogonal directions, SIAM J. Optim., 20 (2009), pp. 948-966.
2. C. Audet, V. Béchard, and S. Le Digabel, Nonsmooth optimizatio through mesh adaptive direct search and variable neighborhood search, J. Global Optim., 41 (2008), pp. 299-318.
3. C. Audet, J. E. Dennis, Jr., and S. Le Digabel, Globalization strategies for mesh adaptive direct search, Comput. Optim. Appl., (2009), DOI 10.1007/s10589-009-9266-1.
4. C. Audet and J. E. Dennis, Jr., Mesh adaptive direct search algorithms for constrained optimization, SIAM J. Optim., 17 (2006), pp. 188-217.
5. J. V. Burke, D. Henrion, A. S. Lewis, and M. L. Overton, Stabilization via nonsmooth, nonconvex optimization, IEEE Trans. Automat. Control, 51 (2006), pp. 1760-1769.
6. J. V. Burke, A. S. Lewis, and M. L. Overton, Approximating subdifferentials by random sampling of gradients, Math. Oper. Res., 27 (2002), pp. 567-584.
7. J. V. Burke, A. S. Lewis, and M. L. Overton, Two numerical methods for optimizing matrix stability, Linear Algebra Appl., 351/352 (2002), pp. 147-184.
8. J. V. Burke, A. S. Lewis, and M. L. Overton, Pseudospectral components and the distance to uncontrollability, SIAM J. Matrix Anal. Appl., 26 (2004), pp. 350-361.
9. J. V. Burke, A. S. Lewis, and M. L. Overton, A robust gradient sampling algorithm for nonsmooth, nonconvex optimization, SIAM J. Optim., 15 (2005), pp. 751-779.
10. A. L. Custodio, J. E. Dennis, Jr., and L. N. Vicente, Using simplex gradients of nonsmooth functions in direct search methods, IMA J. Numer. Anal., 28 (2008), pp. 770-784.
11. F. H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983.
12. A. L. Custódio and L. N. Vicente, Using sampling and simplex derivatives in pattern search methods, SIAM J. Optim., 18 (2007), pp. 537-555.
13. Y. M. Ermoliev, V. I. Norkin, and R. J.-B. Wets, The minimization of semicontinuous functions: Mollifier subgradients, SIAM J. Control Optim., 33 (1995), pp. 149-167.
14. A. A. Goldstein, Optimization of Lipschitz continuous functions, Math. Program., 13 (1977), pp. 14-22.
15. A. M. Gupal, On a minimization method for almost-differentiable functions, Kibernetika, (1977), pp. 114-116 (in Russian). English transl. in Cybernetics, 13 (1977), pp. 115-117.
16. K. C. Kiwiel, Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization, SIAM J. Optim., 6 (1996), pp. 227-249.
17. K. C. Kiwiel, Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization, SIAM J. Optim., 18 (2007), pp. 379-388.
18. A. S. Lewis, Local structure and algorithms in nonsmooth optimization, in Optimization and Applications, F. Jarre, C. Lemaréchal, and J. Zowe, eds., Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, 2005, pp. 104-106.
19. D. Q. Mayne and E. Polak, Nondifferential optimization via adaptive smoothing, J. Optim. Theory Appl., 43 (1984), pp. 601-613.
20. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
21. R. T. Rockafellar and R. J.-B. Wets, Variational Analysis, Springer, Berlin, 1998.