A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
暂无分享,去创建一个
[1] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[2] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..
[3] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .
[4] V. N. Tarasov,et al. A Modification of the Cutting-Plane Method with Accelerated Convergence , 1985 .
[5] Helga Schramm,et al. Eine Kombination von Bundle- und Trust-region-Verfahren zur Lösung nichtdifferenzierbarer Optimierungsprobleme , 1989 .
[6] K. Kiwiel. A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems , 1989 .
[7] Nimrod Megiddo,et al. Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..
[8] C. Lemaréchal. Nondifferentiable optimization , 1989 .
[9] J. Goffin. Affine methods in nondifferentiable optimization , 1987 .
[10] R. Mifflin. A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization , 1982 .
[11] C. Lemaréchal. Nonsmooth Optimization and Descent Methods , 1978 .