Skip to main content
Log in

A Novel Method to Handle Inequality Constraints for Convex Programming Neural Network

  • Published:
Neural Processing Letters Aims and scope Submit manuscript

Abstract

By modifying the multipliers associated with inequality constraints, we can directly solve convex programming problem without nonnegative constraints of the multipliers associated with inequality constraints, hence it is no longer necessary to convert the inequality constraints into the equality constraints by using the ‘slack variables’. With this technique, the neural network to solve convex programming problem is constructed, and its stability is analyzed rigorously. Simulation shows that this method is feasible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Avriel, M.: Nonlinear Programming Analysis and Methods, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1976.

    Google Scholar 

  2. Luenberger, D. G.: Linear and Nonlinear Programming, Addison-Wesley Publishing Company, California, 1984.

    Google Scholar 

  3. Rockafellar, R. T.: Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  4. Bertsekas, D. P.: Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.

    Google Scholar 

  5. Fletcher, R.: Practical Methods of Optimization, John Wiley, New York, 1980.

    Google Scholar 

  6. Hopfield, J. J.: Neural networks and physical systems with emergent collective computational abilities, Proc. Natl. Acad. Sci. USA. 79 (1982), 2554–2558.

    Google Scholar 

  7. Hopfield, J. J.: Neurons with graded response have collective computational properties like those of two-state neurons. Proc. Natl. Acad. Sci. USA. 81 (1984), 3088–3092.

    Google Scholar 

  8. Tank, D. W. and Hopfield, J. J.: Simple 'neural' optimization networks: an A/D converter, signal decision circuit and a linear programming circuit, IEEE Trasn. on CAS, 33 (1986), 533–541.

    Google Scholar 

  9. Kennedy, M. P. and Chua, L. O.: Neural networks for nonlinear programming, IEEE Trasn. on CAS, 35 (1988), 554–562.

    Google Scholar 

  10. Zhang, S. W. and Constantinides, A. G.: Lagrange programming neural networks, IEEE Trans. on CAS, 39 (1992), 441–451.

    Google Scholar 

  11. Zhu, X., Zhang, S. W. and Constantinides, A. G.: Lagrange neural networks for linear programming, Journal of Parallel and Distributed Computing, 14 (1992), 354–360.

    Google Scholar 

  12. Rodriguez-Vazquez, A., Ruede, A., Huertas, J. L. and Dominguez-Castro, R.: Switched-Capacitor 'Neural' networks for linear programming, Electronics Letters, 24 (1988), 496–498.

    Google Scholar 

  13. Rodriguez-Vazquez, A., Dominguez-Castro, R., Ruede, A., Huertas, J. L., and Sanchez-Sinencio, E.: Nonlinear Switched-capacitor 'neural' networks for optimization problems, IEEE Trans. on CAS, 37 (1990), 384–398.

    Google Scholar 

  14. Cichocki, A. and Unbehauen, R.: Switched-capacitor neural networks for differential optimization, International Journal of Circuit Theory and Application, 19 (1991), 161–187.

    Google Scholar 

  15. Cichocki, A. and Unbehauen, R.: Neural Networks for Optimization and Signal Processing, Wiley, New York, 1993.

    Google Scholar 

  16. More, J. J. and Toroaldo, G.: On the solution of large quadratic programming problems with bound constraints, SIAM J. Optimization, 1 (1991), 93–113.

    Google Scholar 

  17. Bouzerdoum, A. and Pattison, T. R.: Neural network for quadratic opitimization with bound constraints, IEEE Trasn. On Neural Networks, 4 (1993), 293–304.

    Google Scholar 

  18. Wang, J.: A Deterministic annealing neural network for convex programming, Neural Networks, 7 (1994), 629–641.

    Google Scholar 

  19. Gafni, E. M. and Bertsekas, D. P.: Two-metric projection methods for constrained optimization, SIAM J. Contr. Optimization, 22 (1984), 936–964.

    Google Scholar 

  20. Pang, J. S.: A posteriori error bounds for the linearly-constrained variational inequality problem, Math. Operations Res., 12 (1984), 474–484.

    Google Scholar 

  21. Marcotte, P.: Application of Khobotov's algorithm to variational inequality and network equilibrium problems, Inform. Syst. Oper. Res., 29 (1991), 258–270.

    Google Scholar 

  22. Kinderlehrer, D. and Stampcchia, G.: An Introduction to Variational Inequality and Their Applications, New York: Academic, 1980.

    Google Scholar 

  23. Xia, Y. and Wang, J.: Neural network for solving linear programming problems with bounded variables, IEEE Trasn. On Neural Networks, 6 (1995), 515–519.

    Google Scholar 

  24. Wu, X., Xia, Y., Li, J., and Wang, J.: A high performance neural network for solving linear and quadratic programming problems, IEEE Trasn. On Neural Networks, 7 (1996), 643–651.

    Google Scholar 

  25. Xia, Y.: A new neural network for solving linear programming problems and its applications, IEEE Trasn. On Neural Networks, 7 (1996), 525–529.

    Google Scholar 

  26. Xia, Y.: Neural network for solving linear and quadratic programming problems, IEEE Trasn. On Neural Networks, 7 (1996), 1544–1547.

    Google Scholar 

  27. Xia, Y.: Neural network for solving extended linear programming problems, IEEE Trasn. On Neural Networks, 8 (1997), 525–529.

    Google Scholar 

  28. Xia, Y. and Wang, J.: A general methodology for designing globally convergent optimization neural networks, IEEE Trasn. On Neural Networks, 9 (1998), 1331–1343.

    Google Scholar 

  29. Liang, X. B. and Wang, J.: A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints, IEEE Trasn. On Neural Networks, 11 (2000), 1251–1262.

    Google Scholar 

  30. Isidori, A.: Nonlinear Control Systems, 3rd Edition, Springer-Verlag, London, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuancan, H. A Novel Method to Handle Inequality Constraints for Convex Programming Neural Network. Neural Processing Letters 16, 17–27 (2002). https://doi.org/10.1023/A:1019795625435

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019795625435

Navigation