On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
暂无分享,去创建一个
[1] K. Knopp. Theory and Application of Infinite Series , 1990 .
[2] M. Solodov,et al. Error Stability Properties of Generalized Gradient-Type Algorithms , 1998 .
[3] Yu. M. Ermol’ev. On the method of generalized stochastic gradients and quasi-Féjer sequences , 1969 .
[4] Claude Lemaréchal,et al. Convergence of some algorithms for convex minimization , 1993, Math. Program..
[5] R. Rockafellar. Local boundedness of nonlinear, monotone operators. , 1969 .
[6] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.
[7] Yu. M. Ermol’ev. Methods of solution of nonlinear extremal problems , 1966 .
[8] Marc Teboulle,et al. Entropy-Like Proximal Methods in Convex Programming , 1994, Math. Oper. Res..
[9] Alfredo N. Iusem,et al. Minimization Of Nonsmooth Convex Functionals In Banach Spaces , 1997 .
[10] K. G. Murty,et al. Convergence of the steepest descent method for minimizing quasiconvex functions , 1996 .
[11] R. Phelps. CONVEX ANALYSIS WITH APPLICATIONS IN DIFFERENTIATION OF CONVEX FUNCTIONS (Research Notes in Mathematics, 58) , 1983 .
[12] David K. Smith,et al. Mathematical Programming: Theory and Algorithms , 1986 .
[13] V. G. Karmanov,et al. The stabilizing properties of the gradient method , 1987 .
[14] A. Iusem,et al. Full convergence of the steepest descent method with inexact line searches , 1995 .
[15] R. Rockafellar,et al. On the subdifferentiability of convex functions , 1965 .