Analysis and design of primal-dual assignment networks

IEEE Transactions on Neural Networks

Volumn 9, Issue 1, 1998, Pages 183-194

  Wang, Jun ^a,b   Xia, Youshen ^a,b,c  

^a IEEE   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Assignment problem; Discrete time systems; Optimization techniques; Recurrent neural networks; Shortest path problem; Sorting problem

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING;

ASSIGNMENT PROBLEMS; CONTINUOUS TIME RECURRENT NEURAL NETWORKS; DISCRETE TIME RECURRENT NEURAL NETWORKS; PRIMAL DUAL ASSIGNMENT NETWORKS;

NEURAL NETWORKS;

EID: 0031701572     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.655040     Document Type: Article

References (31)

1. M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows, 2nd ed. New York: Wiley, 1990.
2. D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
3. T. P. Trondet and S. M. Walters, "Neural-network architecture for crossbar switch control," IEEE Trans. Circuits Syst., vol. 38, pp. 42-56, 1991.
4. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
5. D. W. Tank and J. J. Hopfield, "Simple 'neural optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit," IEEE Trans. Circuits Syst., vol. 33, pp. 533-541, 1986.
6. M. P. Kennedy and L. O. Chua, "Neural networks for nonlinear programming," IEEE Trans. Circuits Syst., vol. 35, pp. 554-562, 1988.
7. A. Rodríguez-Vázquez, R. Domínguez-Castro, A. Rueda, J. L. Huertas, E. Sánchez-Sinencio, "Nonlinear switched-capacitor 'neural networks' for optimization problems," IEEE Trans. Circuits Syst., vol. 37, pp. 384-397, 1990.
8. C. Y. Maa and M. A. Shanblatt, "Linear and quadratic programming neural-network analysis," IEEE Trans. Neural Networks, vol. 3, pp. 580-594, 1992.
9. J. Wang, "Analysis and design of a recurrent neural network for linear programming," IEEE Trans. Circuits Syst. I, vol. 40, no. 9, pp. 613-618, 1993.
10. _, "A deterministic annealing neural network for convex programming," Neural Networks, vol. 7, no. 4, pp. 629-641, 1994.
11. S. H. Zǎk, V. Upatising, and S. Hui, "Solving linear programming problems with neural networks: A comparative study," IEEE Trans. Neural Networks, vol. 6, pp. 94-104, 1995.
12. Y. Xia and J. Wang, "Neural network for solving linear programming problems with bounded variables," IEEE Trans. Neural Networks, vol. 6, pp. 515-519, 1995.
13. Y. Xia, "A new neural network for solving linear programming problems and its applications," IEEE Trans. Neural Networks, vol. 7, pp. 525-529, 1996.
14. Y. Xia, "A new neural network for solving linear and quadratic programming problems," IEEE Trans. Neural Networks, vol. 7, pp. 1544-1547, 1996.
15. A. Cichocki, R. Unbehauen, K. Weinzierl, and R. Holzel, "A new neural network for solving linear programming problems," European J. Operational Res., vol. 93, no. 3, pp. 244-256, 1996.
16. A. Cichocki and R. Unbehauen, Neural Networks for Optimization and Signal Processing. New York: Wiley, 1993.
17. J. Wang, "Recurrent neural networks for optimization," in Fuzzy Logic and Neural Network Handbook, C. H. Chen, Ed. New York: McGraw-Hill, 1996, pp. 4.1-4.35.
18. S. P. Eberhardt, T. Duad, D. A. Kerns, T. X. Brown, and A. P. Thakoor, "Competitive neural architecture for hardware solution to the assignment problem," Neural Networks, vol. 4, no. 4, pp. 431-442, 1991.
19. J. Wang, "Analog neural network for solving the assignment problem," Electron. Lett., vol. 28, no. 11, pp. 1047-1050, 1992.
20. W. J. Wolfe, J. M. MacMillan, G. Brady, R. Mathews, J. A. Rothman, M. D. Orosz, C. Anderson, and G. Alaghband, "Inhibitory grids and the assignment problem," IEEE Trans. Neural Networks, vol. 4, pp. 319-331, 1993.
21. J. J. Kosowsky and A. L. Yuille, "The invisible hand algorithm: Solving the assignment problem with statistical physics," Neural Networks, vol. 7, pp. 477-490, 1994.
22. K. Urahama, "Analog circuit for solving assignment problem," IEEE Trans. Circuits Syst. I, vol. 40, pp. 426-429, 1994.
23. P.-Y. Ting and R. A. Iltis, "Diffusion network architectures for implementation of Gibbs sampler with applications to the assignment problem," IEEE Trans. Neural Networks, vol. 5, pp. 622-638, 1994.
24. W. J. Wolfe and R. M. Ulmer, "Orthogonal projections applied to the assignment problem," IEEE Trans. Neural Networks, vol. 8, pp. 774-778, 1997.
25. J. Wang, "Primal and dual assignment networks," IEEE Trans. Neural Networks, vol. 8, pp. 784-790, 1997.
26. J. M. Ortega and W. G. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. New York: Academic, 1970.
27. G. H. Golub and C. F. Loan, Matrix Computations, 3rd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1996.
28. T. H. Corman, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990, ch. 2.
29. J. Wang, "Analysis and design of an analog sorting network," IEEE Trans. Neural Networks, vol. 6, pp. 962-971, 1995.
30. J. Wang, "A recurrent neural network for solving the shortest path problem," IEEE Trans. Circuits Syst I, vol. 43, pp. 482-486, 1996.
31. X. Lu, "An approximate Newton method for solving linear programming," J. Numer. Aomputa. Applicat., vol. 15, no. 1, 1994.