Projected Newton methods and optimization of multicommodity flows
暂无分享,去创建一个
[1] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[2] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .
[3] A. Goldstein. Convex programming in Hilbert space , 1964 .
[4] Boris Polyak,et al. Constrained minimization methods , 1966 .
[5] M. Canon,et al. A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm , 1968 .
[6] D. Goldfarb. Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .
[7] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.
[8] Stella Dafermos,et al. An Extended Traffic Assignment Model with Applications to Two-Way Traffic , 1971 .
[9] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.
[10] D. Bertsekas. On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.
[11] Michael Florian,et al. A Method for Computing Network Equilibrium with Elastic Demands , 1974 .
[12] D. Bertsekas. Partial conjugate gradient methods for a class of optimal control problems , 1974 .
[13] Olvi L. Mangasarian,et al. Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems , 1976, Math. Program..
[14] Dimitri P. Bertsekas,et al. Numerical methods for constrained optimization , 1976 .
[15] Michael Florian. An improved linear approximation algorithm for the network equilibrium (packet switching) problem , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.
[16] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..
[17] J. Dunn. Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals , 1979, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.
[18] Melanie L. Lenard,et al. A computational study of active set strategies in nonlinear programming with linear constraints , 1979, Math. Program..
[19] Dimitri P. Bertsekas,et al. Algorithms for Nonlinear Multicommodity Network Flow Problems , 1979 .
[20] J. Dunn. Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems , 1980 .
[21] D. Bertsekas. A class of optimal routing algorithms for communication networks , 1980 .
[22] Stella Dafermos,et al. Traffic Equilibrium and Variational Inequalities , 1980 .
[23] Robert G. Gallager,et al. Flow Control and Routing Algorithms for Data Networks , 1980 .
[24] Magnus R. Hestenes,et al. Conjugate Direction Methods in Optimization , 1980 .
[25] J. Dunn. Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes , 1981 .
[26] D. Bertsekas. Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[27] T. Magnanti,et al. Equilibria on a Congested Transportation Network , 1981 .
[28] R. Dembo,et al. A scaled reduced gradient algorithm for network flow problems with convex separable costs , 1981 .
[29] Eliezer M. Gafni,et al. The integration of routing and flow-control for voice and data in a computer communication network , 1982 .
[30] D. Bertsekas,et al. Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .