Resultant projection neural networks for optimization under inequality constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 26, Issue 4, 1996, Pages 509-521

  Vinod, V V ^b   Ghose, Sujoy ^a,c   Chakrabarti, Partha P ^a,c  

^a IEEE

^b NTT Basic Research Laboratories   (Japan)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; LYAPUNOV METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

COMPUTING ELEMENTS; HOPFIELD NETWORK; INEQUALITY CONSTRAINTS; KNAPSACK PROBLEM; LYAPUNOV FUNCTION; RESULTANT PROJECTION NEURAL NETWORKS;

NEURAL NETWORKS;

EID: 0030216552     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. K. F. Cheung, S. Oh, R. J. Marks II, and L. E. Atlas, "Neural net associative memory based on convex set projections," in Proc. IEEE First Int. Conf. on Neural Networks, San Diego, CA, pp. III245-III252, June 1987.
2. M. A. Cohen and S. Grossberg, "Absolute stability of global pattern formation and parallel memory storage by competitive neural networks," IEEE Trans. Syst. Man, Cybern., vol. 13, no. 5, Sept./Oct. 1983.
3. G. W. Davis Jr., "Sensitivity analysis in neural net solutions," IEEE Trans. Syst. Man, Cybern., vol. 19, no. 5, Sept./Oct. 1989.
4. R. Dublin and D. Willshaw, "An analogue approach to the travelling salesman problem using elastic net method," Nature, vol. 326, no. 6114, pp. 689-691, Apr. 1987.
5. A. Erdelyi, Ed., Tables of Integral Transforms, vol. I. New York: McGraw-Hill, 1954, Bateman Manuscript Project.
6. W. Feller, An Introduction to Probability Theory and Its Applications, vol. II. New York: Wiley 1965.
7. _, An Introduction to Probability Theory and Its Applications, vol. I. New York: Wiley, 1968.
8. S. Grossberg, "Nonlinear neural networks: Principles, mechanisms and architecture," Neural Networks, vol. 1, pp. 17-61, 1988.
9. P. R. Halmos, Measure Theory. New York: Van Nostrand, 1962.
10. B. J. Hellstrom and L. N. Kanal, "The definition of necessary hidden units in neural networks for combinatorial optimization," Univ. of Maryland, Tech. Rep. UMIACS-TR-90-6, CS-TR-2388, 1990.
11. _, "Knapsack packing networks," IEEE Trans. Neural Networks, vol. 3, no. 2, pp. 308-314, Mar. 1992.
12. M. W. Hirsch, "Systems of differential equations which are competitive or cooperative I: Limit sets," SIAM J. Math. Anal., vol. 13, no. 2, pp. 167-179, Mar. 1982.
13. _, "Systems of differential equations which are competitive or cooperative II: Convergence almost everywhere," SIAM J. of Math. Anal., vol. 16, no. 3, pp. 423-439, May 1985.
14. J. J. Hopfield, "Neural networks and physical systems with emergent collective computational abilities," Proc. Nat. Acad. Sci., vol. 79, pp. 2554-2558, 1982.
15. _, "Neurons with graded response have collective computational properties like those of two state neurons," Proc. Nat. Acad. Sci., vol. 81, pp. 3088-3092, May 1984.
16. J. J. Hopfield and D. W. Tank, "Computing with neural circuits: A model," Science, vol. 233, pp. 625-633, 1984.
17. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Galgotia Publications, 1985.
18. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, May 1983.
19. P. Lippmann, "An introduction to computing with neural nets," IEEE ASSP Mag., pp. 4-22, Apr. 1987.
20. R. J. Marks II, S. Oh, and L. E. Atlas, "Alternating projection neural networks," IEEE Trans. Circuits Syst., vol. 36, no. 6, pp. 846-857, June 1989.
21. S. Montello and P. Toth, Knapsack Problems: Algorithms and Computer Implantation. Chichester, UK: Wiley, 1991.
22. G. L. Nemhauser and L. A. Wolsey, "Integer and Combinatorial Optimization. New York: Wiley, 1988.
23. C. Peterson and J. R. Anderson, "Neural networks and NP-complete optimization problems," Complex Syst., vol. 2, no. 59, 1988.
24. C. Peterson and B. Söderberg, "A new method for mapping optimization problems onto neural networks," Int. J. Neural Syst., vol. 1, no. 3, 1989.
25. D. E. Rumelhart and J. L. McClelland, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, vol. I: Foundations. Cambridge, MA: MIT Press, 1986.
26. Y. Takefuji and K. C. Lee, "A near-optimum parallel planarization algorithm," Science, vol. 245, pp. 1221-1223, Sept. 1989.
27. K. S. Trivedi, Probability and Statistics with Reliability, Queueing and Computer Science Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
28. D. E. VandenBout and T. K. Miller III, "Graph partitioning using annealed neural networks," Neural Networks, vol. 1, no. 2, June 1990.
29. V. V. Voyevodin, Linear Algebra. Moscuw: Mir, 1983.