Smoothing projected gradient method and its application to stochastic linear complementarity problems

SIAM Journal on Optimization

Volumn 20, Issue 2, 2009, Pages 627-649

  Zhang, Chao ^a   Chen, Xiaojun ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Constrained optimization; Image restoration; Nonconvex; Nonsmooth; Smoothing projected gradient method; Stochastic linear complementarity problem

Indexed keywords

IMAGE RESTORATION; NON-SMOOTH; NONCONVEX; PROJECTED GRADIENT; STOCHASTIC LINEAR COMPLEMENTARITY PROBLEM;

FUNCTIONS; GRADIENT METHODS; IMAGE RECONSTRUCTION; RESTORATION; SET THEORY; STOCHASTIC SYSTEMS;

CONSTRAINED OPTIMIZATION;

EID: 70450260767     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/070702187     Document Type: Article

References (31)

1. E. G. BIRGIN, J. M. MARTÍNEZ, AND M. RAYDAN, Nonmonotone spectral projected gradient methods on convex sets, SIAM J. Optim., 10 (2000), pp. 1196-1211.
2. 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.
3. P. H. CALAMAI AND J. J. MORÉ, Projected gradient method for linearly constrained problems, Math. Program., 39 (1987), pp. 93-116.
4. 0 NCP or monotone NCP, SIAM J. Optim., 9 (1999), pp. 624-645.
5. C. CHEN AND O. L. MANGASARIAN, A class of smoothing functions for nonlinear and mixed complementarity problems, Comput. Optim. Appl., 5 (1996), pp. 97-138.
6. X. CHEN AND M. FUKUSHIMA, Expected residual minimization method for stochastic linear complementarity problems, Math. Oper. Res., 30 (2005), pp. 1022-1038.
7. X. CHEN, L. QI, AND D. SUN, Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities, Math. Comp., 67 (1998), pp. 519-540.
8. X. CHEN AND Y. YE, On homotopy-smoothing methods for box-constrained variational inequalities, SIAM J. Control Optim., 37 (1999), pp. 589-616.
9. X. CHEN, C. ZHANG, AND M. FUKUSHIMA, Robust solution of monotone stochastic linear complementarity problems, Math. Program., 117 (2009), pp. 51-80.
10. F. H. CLARKE, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, (reprinted by SIAM, Philadelphia), 1990.
11. R. W. COTTLE, J.-S. PANG, AND R. E. STONE, The Linear Complementarity Problem, Academic Press, Boston, 1992.
12. J. C. DUNN, Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Control. Optim., 19 (1981), pp. 368-400.
13. F. FACCHINEI AND J.-S. PANG, Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer, New York, 2003.
14. 0 matrix linear complementarity problems, SIAM J. Optim., 18 (2007), pp. 482-506.
15. 1 norms for image restoration, SIAM J. Sci. Comput., 27 (2006), pp. 1881-1902.
16. A. A. GOLDSTEIN, Convex programming in Hilbert space, Bull. Amer. Soc, 70 (1964), pp. 709-710.
17. A. JUDITSKY, G. LAN, A. NEMIROVSKI, AND A. SHAPIRO, Stochastic approximation approach to stochastic programming, SIAM J. Optim., submitted, http://www.optimization-online.org/DB-FILE/2007/09/1787.pdf.
18. A. J. KLEYWEGT, A. SHAPIRO, AND T. HOMEN-DE-MELLO, The sample average approximation method for stochastic discrete optimization, SIAM J. Optim., 112 (2002), pp. 479-502.
19. K. C. KIWIEL, Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization, SIAM J. Optim., 18 (2007), pp. 379-388.
20. E. S. LEVITIN AND B. T. POLYAK, Constrained minimization problems, USSR Comput. Math. Math. Phys., 6 (1966), pp. 1-50.
21. T. D. LUCA, F. FACCHINEI, AND C. KANZOW, A semismooth equation approach to the solution of nonlinear complementarity problems, Math. Program., 75 (1996), pp. 407-439.
22. Z.-Q. LUO, J.-S. PANG, AND D. RALPH, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, London, 1996.
23. M. NIKOLOVA, M. K. NG, S. ZHANG, AND W.-K. Ching, Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization, SIAM J. Img. Sci., 1 (2008), pp. 2-25.
24. B. T. POLYAK AND A. JUDITSKY, Acceleration of stochastic approximation by averaging, SIAM J. Control Optim., 30 (1992), pp. 838-855.
25. H. ROBBINS AND S. MONRO, A stochastic approximation method, Ann. Math. Statist., 22 (1951), pp. 400-407.
26. R. T. ROCKAFELLAR AND A. J-B. WETS, Variational Analysis, Springer, Berlin, 1998.
27. A. RUSZCYŃSKI AND A. SHAPIRO, EDS., Stochastic Programming, Handbooks Oper. Res. Management Sci. 10, North-Holland, Amsterdam, 2003.
28. A. SCHWARTZ AND E. POLAK, Family of projected descent methods for optimization problems with simple bounds, J. Optim. Theory Appl., 92 (1997), pp. 1-31. (Pubitemid 127355474)
29. A. SHAPIRO AND H. XU, Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions, J. Math. Anal. Appl., 325 (2007), pp. 1390-1399.
30. N. Z. SHOR, Minimization Methods for Non-Differentiable Functions, Springer, Berlin, 1985.
31. N. H. XIU AND J. Z. ZHANG, Some recent advances in projection-type methods for variational inequalities, J. Comput. Appl. Math., 152 (2003), pp. 559-585.