Approximate Subgradient Methods for Lagrangian Relaxations on Networks
暂无分享,去创建一个
[1] E. Mijangos. Approximate Subgradient Methods for Nonlinearly Constrained Network Flow Problems , 2006 .
[2] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[3] Daniel Tuyttens,et al. On large scale nonlinear Network optimization , 1990, Math. Program..
[4] Dimitri P. Bertsekas,et al. Incremental Subgradient Methods for Nondifferentiable Optimization , 2001, SIAM J. Optim..
[5] Yu. M. Ermol’ev. Methods of solution of nonlinear extremal problems , 1966 .
[6] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .
[7] Krzysztof C. Kiwiel,et al. Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization , 2003, SIAM J. Optim..
[8] Eugenio Mijangos,et al. A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks , 2006, ICCSA.
[9] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.
[10] Michael A. Saunders,et al. Large-scale linearly constrained optimization , 1978, Math. Program..
[11] O. Nelles,et al. An Introduction to Optimization , 1996, IEEE Antennas and Propagation Magazine.
[12] Claude Lemaréchal,et al. Convergence of some algorithms for convex minimization , 1993, Math. Program..
[13] Eugenio Mijangos,et al. On the first-order estimation of multipliers from Kuhn-Tucker systems , 2001, Comput. Oper. Res..
[14] David Taniar,et al. Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I , 2006, ICCSA.