论文信息 - Finiteness in restricted simplicial decomposition - 字舞流文

Finiteness in restricted simplicial decomposition

J. A. Ventura | D. Hearn | S. Lawphongpanich

[1] 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.

[2] Balder Von Hohenbalken,et al. Simplicial decomposition in nonlinear programming algorithms , 1977, Math. Program..

[3] Balder Von Hohenbalken,et al. A finite algorithm to maximize certain pseudoconcave functions on polytopes , 1975, Math. Program..

[4] Charles A. Holloway. An extension of the frank and Wolfe method of feasible directions , 1974, Math. Program..

[5] Mario Gerla,et al. Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[6] George L. Nemhauser,et al. A Column Generation Algorithm for Optimal Traffic Assignment , 1973 .

[7] Arthur M. Geoffrion,et al. Elements of Large-Scale Mathematical Programming Part I: Concepts , 1970 .

[8] Arthur M. Geoffrion,et al. Elements of large-scale mathematical programming , 1969 .

[9] M. Canon,et al. A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm , 1968 .

[10] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .

[11] M. J. D. Powell,et al. Variable Metric Methods for Constrained Optimization , 1982, ISMP.

[12] M. S. Bazaraa,et al. Nonlinear Programming , 1979 .