A new neural network framework for solving convex second-order cone constrained variational inequality problems with an application in multi-finger robot hands

References

• Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (1993). Non-linear programming, theory and algorithms (second ed.). New York: Wiley.
   Google Scholar
• Benson, H. Y., & Vanderbei, R. J. (2003). Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming. Mathematical Programming, Series B, 95(2), 279–302.
   Web of Science ®Google Scholar
• Ben-Tal, A., EI Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. New Jersey: Princeton University Press.
   Google Scholar
• Ben-Tal, A., & Nemirovski, A. (2001). Lectures on modern convex optimization,: Analysis, algorithms, and engineering applications. Philadelphia: MPS/SIAM Series on Optimization.
   Google Scholar
• Chen, J.-S. (2006). The semismooth-related properties of a merit function and a decent method for the non-linear complementarity problem. Journal of Global Optimization, 36(4), 565–580.
   Web of Science ®Google Scholar
• Chen, J.-S., Gao, H.-T., & Pan, S.-H. (2009). An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function. Journal of Computational and Applied Mathematics, 232(2), 455–471.
   Web of Science ®Google Scholar
• Chen, J.-S., Ko, C.-H., & Pan, S.-H. (2010). A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems. Information Sciences, 180(5), 697–711.
   Web of Science ®Google Scholar
• Chen, J.-S., & Pan, S.-H. (2008). A family of NCP functions and a descent method for the nonlinear complementarity problem. Computational Optimization and Applications, 40(3), 389–404.
   Web of Science ®Google Scholar
• Chen, X., Qi, L., & Sun, D. (1998). Global and super linear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. Mathematics of Computation, 67, 519–540.
   Web of Science ®Google Scholar
• Dang, C., Leung, Y., Gao, X., & Chen, K. (2004). Neural networks for nonlinear and mixed complementarity problems and their applications. Neural Networks, 17(2), 271–283.
   PubMed Web of Science ®Google Scholar
• Effati, S., Ghomashi, A., & Nazemi, A. R. (2007). Application of projection neural network in solving convex programming problems. Applied Mathematics and Computation, 188(2), 1103–1114.
   Web of Science ®Google Scholar
• Effati, S., & Nazemi, A. R. (2006). Neural network and its application for solving linear and quadratic programming problems. Applied Mathematics and Computation, 172(1), 305–331.
   Web of Science ®Google Scholar
• Facchinei, F., & Pang, J. (2003). Finite-dimensional variational inequalities and complementarity problems. New York: Springer.
   Google Scholar
• Hammond, J. (1984). Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms ( Ph.D. Dissertation). Department of Mathematics, MIT, Cambridge.
   Google Scholar
• Han, Q., Liao, L.-Z., Qi, H., & Qi, L. (2001). Stability analysis of gradient-based neural networks for optimization problems. Journal of Global Optimization, 19(4), 363–381.
   Web of Science ®Google Scholar
• Harker, P., & Pang, J.-S. (1990). Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Mathematical Programming, 48(1–3), 161–220.
   Web of Science ®Google Scholar
• Hartman, P., & Stampacchia, G. (1966). On some nonlinear elliptic differential functional equations. Acta Mathematica, 115, 271–310.
   Web of Science ®Google Scholar
• Hu, X., & Wang, J. (2006). Solving pseudo-monotone variational inequalities and pseudo-convex optimization problems using the projection neural network. IEEE Transactions on Neural Networks, 17(6), 1487–1499.
   PubMedGoogle Scholar
• Hu, X., & Wang, J. (2007). A recurrent neural network for solving a class of general variational inequalities. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 37(3), 528–539.
   PubMed Web of Science ®Google Scholar
• Kanno, Y., Martins, J. A. C., & Da Costa, A. P. (2006). Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem. International Journal for Numerical Methods in Engineering, 65(1), 62–83.
   Web of Science ®Google Scholar
• Kennedy, M. P., & Chua, L. O. (1988). Neural network for nonlinear programming. IEEE Transactions on Circuits and Systems, 35(5), 554–562.
   Google Scholar
• Kinderlehrer, D., & Stampacchia, G. (1980). An introduction to variational inequalities and their applications. San Diego: Academic Press.
   Google Scholar
• Ko, C. H., Chen, J. S., & Yang, C. Y. (2011). Recurrent neural networks for solving second-order cone programs. Neurocomputing, 74(17), 3646–3653.
   Web of Science ®Google Scholar
• Liao, L.-Z., Qi, H., & Qi, L. (2001). Solving nonlinear complementarity problems with neural networks: A reformulation method approach. Journal of Computational and Applied Mathematics, 131(1–2), 342–359.
   Web of Science ®Google Scholar
• Lillo, W. E., Loh, M. H., Hui, S., & Zäk, S. H. (1993). On solving constrained optimization problems with neural networks: A penalty method approach. IEEE Transactions on Neural Networks, 4(6), 931–939.
   PubMedGoogle Scholar
• Lions, J., & Stampacchia, G. (1967). Variational inequalities. Communications on Pure and Applied Mathematics, 20(3), 493–519.
   Web of Science ®Google Scholar
• Mancino, O., & Stampacchia, G. (1972). Convex programming and variational inequalities. Journal of Optimization Theory and Applications, 9(1), 3–23.
   Google Scholar
• Miao, X., Chen, J. S., & Ko, C. H. (2014). A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints. Information Sciences, 268, 255–270.
   Web of Science ®Google Scholar
• Miao, X., Chen, J. S., & Ko, C. H. (2016). A neural network based on the generalized FB function for nonlinear convex programs with second-order cone constraints. Neurocomputing, 203(26), 62–72.
   Google Scholar
• Miller, R. K., & Michel, A. N. (1982). Ordinary differential equations. New York: Academic Press.
   Google Scholar
• Nazemi, A. R. (2011). A dynamical model for solving degenerate quadratic minimax problems with constraints. Journal Of Computational and Applied Mathematics, 236(6), 1282–1295. doi:10.1016/j.cam.2011.08.012
   Web of Science ®Google Scholar
• Nazemi, A. R. (2012). A dynamic system model for solving convex nonlinear optimization problems. Communications in Nonlinear Science and Numerical Simulation, 17(4), 1696–1705.
   Web of Science ®Google Scholar
• Nazemi, A. R. (2013). Solving general convex nonlinear optimization problems by an efficient neurodynamic model. Engineering Applications of Artificial Intelligence, 26(2), 685–696.
   Web of Science ®Google Scholar
• Nazemi, A. R. (2017). A capable neural network framework for solving degenerate quadratic optimization problems with an application in image fusion. Neural Processing Letters, 47(1), 167–192.
   Web of Science ®Google Scholar
• Nazemi, A. R., & Effati, S. (2013). An application of a merit function for solving convex programming problems. Computers and Industrial Engineering, 66(2), 212–221.
   Web of Science ®Google Scholar
• Nazemi, A. R., & Nazemi, M. (2014). A gradient-based neural network method for solving strictly convex quadratic programming problems. Cognitive Computation, 6(3), 484–495.
   Web of Science ®Google Scholar
• Qin, S, & Xue, X. (2014). A two-layer recurrent neural network for nonsmooth convex optimization problems. Ieee Transactions on Neural Systems and Learning Systems, 26(6), 1149–1160.
   PubMed Web of Science ®Google Scholar
• Stampacchia, G. (1964). Formes bilineares coercives sur les ensembles convexes. Compte Rendus de l’Acadmie des Sciences, Paris, 258(1964), 4413–4416.
   Google Scholar
• Stampacchia, G. (1968). Variational inequalities. Theory and applications of monotone operators. In Proceedings of the NATO Advanced Study Institute, Venice. pp. 101–192.
   Google Scholar
• Sun, J., Chen, J. S., & Ko, C. H. (2012). Neural networks for solving second-order cone constrained variational inequality problem. Computational Optimization and Applications, 51, 623–648.
   Web of Science ®Google Scholar
• Wright, S. J. (1994). An infeasible-interior-point algorithm for linear complementarity problems. Mathematical Programming, 67(1–3), 29–51.
   Web of Science ®Google Scholar
• Xia, Y., Leung, H., & Wang, J. (2002). A projection neural network and its application to constrained optimization problems. IEEE Transactions on Circuits and Systems, 49(4), 447–458.
   Google Scholar
• Xia, Y., Leung, H., & Wang, J. (2004). A general projection neural network for solving monotone variational inequalities and related optimization problems. IEEE Transactions on Neural Networks, 15(2), 318–328.
   PubMed Web of Science ®Google Scholar
• Xia, Y., & Wang, J. (2005). A recurrent neural network for solving nonlinear convex programs subject to linear constraints. IEEE Transactions on Neural Networks, 16(2), 379–386.
   PubMedGoogle Scholar
• Yang, Y., & Cao, J. (2008). A feedback neural network for solving convex constraint optimization problems. Applied Mathematics and Computation, 201(1–2), 340–350.
   Web of Science ®Google Scholar
• Yang, Y., Cao, J., Xua, X., Hua, M., & Gao, Y. (2014). A new neural network for solving quadratic programming problems with equality and inequality constraints. Mathematics and Computers in Simulation, 101, 103-–112.
   Web of Science ®Google Scholar
• Yashtini, M., & Malek, A. (2007). Solving complementarity and variational inequalities problems using neural networks. Applied Mathematics and Computation, 190(1), 216–230.
   Web of Science ®Google Scholar
• Zak, S. H., Upatising, V., & Hui, S. (1995). Solving linear programming problems with neural networks: A comparative study. IEEE Transactions on Neural Networks, 6(1), 94–104.
   PubMedGoogle Scholar
• Zhang, Y. (2017). A projected-based neural network method for second-order cone programming. International Journal of Machine Learning and Cybernetics, 8(6), 1907-–1914.
   Web of Science ®Google Scholar