A modified reduced gradient method for a class of nondifferentiable problems
暂无分享,去创建一个
[1] P. Huard. CONVERGENCE OF THE REDUCED GRADIENT METHOD , 1975 .
[2] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[3] Joseph G. Ecker,et al. Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs) , 1969 .
[4] J. Ecker,et al. A modified concave simplex algorithm for geometric programming , 1975 .
[5] Willard I. Zangwill,et al. The Convex Simplex Method , 1967 .
[6] Clarence Zener,et al. Geometric Programming : Theory and Application , 1967 .
[7] Y. Smeers,et al. A modified reduced gradient method for dual posynomial programming , 1978 .
[8] C. Lemaréchal. An extension of davidon methods to non differentiable problems , 1975 .
[9] R. Rockafellar. Some Convex Programs Whose Duals Are Linearly Constrained , 1970 .
[10] J. Ecker,et al. Geometric programming: Duality in quadratic programming and lp-approximation III (degenerate programs) , 1970 .
[11] P. Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .