Extended Monotropic Programming and Duality
暂无分享,去创建一个
[2] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[3] D. Bertsekas,et al. Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals , 1971 .
[4] D. Bertsekas,et al. A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .
[5] R. Rockafellar. MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY , 1981 .
[6] D. Bertsekas. Network Flows and Monotropic Optimization (R. T. Rockafellar) , 1985 .
[7] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[8] Dimitri P. Bertsekas,et al. Data networks (2nd ed.) , 1992 .
[9] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[10] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[11] Alberto Seeger,et al. Subdifferential calculus without qualification conditions, using approximate subdifferentials: a survey , 1995 .
[12] M. Pullan. CONVEX ANALYSIS AND MINIMIZATION ALGORITHMS Volumes I and II (Comprehensive Studies in Mathematics 305, 306) , 1995 .
[13] Dimitri P. Bertsekas,et al. Network optimization : continuous and discrete models , 1998 .
[14] Dimitri P. Bertsekas,et al. Convex Analysis and Optimization , 2003 .
[15] Paul Tseng. Some convex programs without a duality gap , 2009, Math. Program..