A descent method with linear programming subproblems for nondifferentiable convex optimization
暂无分享,去创建一个
[1] V. F. Dem'yanov,et al. Nondifferentiable Optimization , 1985 .
[2] D. Bertsekas,et al. A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .
[3] P. Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .
[4] R. Mifflin. A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization , 1982 .
[5] Sehun Kim,et al. Variable target value subgradient method , 1991, Math. Program..
[6] K. Kiwiel. An ellipsoid trust region bundle method for nonsmooth convex minimization , 1989 .
[7] Sehun Kim,et al. Convergence of a generalized subgradient method for nondifferentiable convex optimization , 1991, Math. Program..
[8] C. E. Lemke,et al. A Method of Solution for Quadratic Programs , 1962 .
[9] A. Auslender. Numerical methods for nondifferentiable convex optimization , 1987 .
[10] Masao Fukushima,et al. A descent algorithm for nonsmooth convex optimization , 1984, Math. Program..
[11] Manlio Gaudioso,et al. A bundle type approach to the unconstrained minimization of convex nonsmooth functions , 1982, Math. Program..
[12] Boris Polyak. Minimization of unsmooth functionals , 1969 .
[13] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[14] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..
[15] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[16] C. Lemaréchal. Nonsmooth Optimization and Descent Methods , 1978 .