Using two successive subgradients in the ellipsoid method for nonlinear programming
暂无分享,去创建一个
[1] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.
[2] Michael Kupferschmid,et al. A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming , 1989, Math. Program..
[3] M. Todd,et al. The Ellipsoid Method: A Survey , 1980 .
[4] N. Z. Shor,et al. A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients , 1971 .
[5] N. Z. Shor. Cut-off method with space extension in convex programming problems , 1977, Cybernetics.
[6] Michael Kupferschmid,et al. Using deep cuts in an ellipsoid algorithm for nonlinear programming , 1985 .
[7] N. Z. Shor,et al. Family of algorithms for solving convex programming problems , 1979 .
[8] Joseph G. Ecker,et al. A class of rank-two ellipsoid algorithms for convex programming , 1984, Math. Program..
[9] Hans-Jakob Lüthi,et al. On the Solution of Variational Inequalities by the Ellipsoid Method , 1985, Math. Oper. Res..
[10] J. Ecker,et al. A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms , 1985 .
[11] Michael J. Todd. On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid , 1982, Math. Oper. Res..
[12] Mordecai Avriel,et al. Nonlinear programming , 1976 .
[13] Michael Kupferschmid,et al. An ellipsoid algorithm for nonlinear programming , 1983, Math. Program..
[14] Michael J. Todd,et al. Feature Article - The Ellipsoid Method: A Survey , 1981, Oper. Res..