Note on a method of conjugate subgradients for minimizing nondifferentiable functions
暂无分享,去创建一个
[1] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[2] P. Wolfe,et al. The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices , 1975 .
[3] K. Ritter,et al. On the Convergence and Rate of Convergence of the Conjugate Gradient Method. , 1971 .
[4] N. Z. Shor. Convergence rate of the gradient descent method with dilatation of the space , 1970 .
[5] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[6] G. Dantzig,et al. The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. , 1961 .
[7] Arthur M. Geoffrion,et al. Elements of large-scale mathematical programming , 1969 .
[8] D. Bertsekas,et al. A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .
[9] M. Held,et al. Large scale optimization and the relaxation method , 1972, ACM Annual Conference.
[10] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[11] P. Wolfe. On the convergence of gradient methods under constraint , 1972 .
[12] Jon W. Tolle,et al. Exact penalty functions in nonlinear programming , 1973, Math. Program..
[13] Claude Lemaréchal,et al. An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.
[14] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.
[15] H. Crowder,et al. Linear convergence of the conjugate gradient method , 1972 .
[16] Vladimir F. Demjanov. Algorithms for Some Minimax Problems , 1968, J. Comput. Syst. Sci..
[17] N. Z. Shor. Utilization of the operation of space dilatation in the minimization of convex functions , 1972 .