Approximations in Decomposition of Large-Scale Convex Programs via a Nondifferentiable Optimization Method
暂无分享,去创建一个
[1] K. Kiwiel. A constraint linearization method for nondifferentiable convex minimization , 1987 .
[2] K. Kiwiel. An algorithm for nonsmooth convex minimization with errors , 1985 .
[3] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[4] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..
[5] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .
[6] Krzysztof C. Kiwiel,et al. Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization , 1991, Math. Program..
[7] Jonathan E. Spingarn,et al. Applications of the method of partial inverses to convex programming: Decomposition , 1985, Math. Program..
[8] Hanif D. Sherali,et al. A class of convergent primal-dual subgradient algorithms for decomposable convex programs , 1986, Math. Program..
[9] K. Kiwiel. A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems , 1989 .