×

A novel neural dynamical approach to convex quadratic program and its efficient applications. (English) Zbl 1411.90253

Summary: This paper proposes a novel neural dynamical approach to a class of convex quadratic programming problems where the number of variables is larger than the number of equality constraints. The proposed continuous-time and proposed discrete-time neural dynamical approach are guaranteed to be globally convergent to an optimal solution. Moreover, the number of its neurons is equal to the number of equality constraints. In contrast, the number of neurons in existing neural dynamical methods is at least the number of the variables. Therefore, the proposed neural dynamical approach has a low computational complexity. Compared with conventional numerical optimization methods, the proposed discrete-time neural dynamical approach reduces multiplication operation per iteration and has a large computational step length. Computational examples and two efficient applications to signal processing and robot control further confirm the good performance of the proposed approach.

MSC:

90C20 Quadratic programming
90C25 Convex programming
90C60 Abstract computational complexity for mathematical programming problems
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Baker, D.R.; Wampler, C.W., On the inverse kinematics of redundant manipulators, International journal of robotics research, 7, 3-21, (1988)
[2] Bazaraa, M.S.; Sherali, H.D.; Shetty, C.M., Nonlinear programming — theory and algorithms, (1993), John Wiley New York · Zbl 0774.90075
[3] Cheng, F.-T.; Chen, T.-H.; Sun, Y.-Y., Resolving manipulator redundancy under inequality constraints, IEEE journal of robotics and automation, 10, 1, 65-71, (1994)
[4] Cheng, L.; Hou, Z.G.; Tan, M., Constrained multi-variable generalized predictive control using a dual neural network, Neural computing and applications, 16, 505-512, (2007)
[5] Cheng, F.-T.; Sheu, R.-J.; Chen, T.-H., The improved compact QP method for resolving manipulator redundancy, IEEE transactions on systems man and cybernetics, 25, 11, 1521-1530, (1995)
[6] Cichocki, A.; Unbehauen, R., Neural networks for optimization and signal processing, (1993), Wiley England · Zbl 0824.68101
[7] Coleman, T.F.; Liu, J., An exterior Newton method for strictly convex quadratic programming, Computational optimization and applications, 15, 5-32, (2000) · Zbl 0942.90031
[8] Ding, H.; Tso, S.K., A fully neural-network-based planning scheme for torque minimization of redundant manipulators, IEEE transactions on industrial electronics, 46, 199-206, (1999)
[9] Dubey, R.V.; Euler, J.A.; Bobcock, S.M., Real-time implementation of an optimization scheme for seven-degree-of-freedom redundant manipulators, IEEE journal of robotics and automation, 7, 579-588, (1991)
[10] Grant, M.; Boyd, S.; Ye, Y.Y., Disciplined convex programming, () · Zbl 1130.90382
[11] Guez, A., & Ahmad, Z. (1989). Accelerated convergence in the inverse kinematics via multilayer feedforward networks. In Proc. int. conf. on neural networks. Vol. II (pp. 341-344); Guez, A., & Ahmad, Z. (1989). Accelerated convergence in the inverse kinematics via multilayer feedforward networks. In Proc. int. conf. on neural networks. Vol. II (pp. 341-344)
[12] Hu, X.; Wang, J., An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application, IEEE transactions on neural networks, 19, 12, 2022-2031, (2008)
[13] Kamel, M.S.; Xia, Y.S., Cooperative recurrent modular neural networks for constrained optimization: A survey of models and applications, Cognitive neurodynamics, 3, 47-81, (2009)
[14] Kennedy, M.P.; Chua, L.O., Neural networks for nonlinear programming, IEEE transactions on circuits and systems, 35, 554-562, (1988)
[15] Kinderlehrer, D.; Stampcchia, G., An introduction to variational inequalities and their applications, (1980), Academic Press New York
[16] Kwon, W.; Lee, B.H.; Cho, M.H., Resolving constrained kinematic redundancy of a robot using a quadratically constrained optimization technique, Robotica, 17, 503-511, (1999)
[17] Liao, L.-Z., A continuous method for convex programming problems, Journal of optimization theory and application, 124, 207-226, (2005) · Zbl 1137.90012
[18] Liao, L.-Z.; Qi, H.D.; Qi, L.Q., Neurodynamical optimization, Journal of global optimization, 28, 175-195, (2004) · Zbl 1058.90062
[19] Li, W.; Swetits, J., A new algorithm for solving strictly convex quadratic programs, SIAM journal of optimization, 7, 595-619, (1997) · Zbl 0891.90133
[20] Liu, Q. S., & Cao, J. D. (2009). A discrete-time recurrent neural network with one neuron for k-Winners-Take-All operation. In International symposium on neural networks (in press); Liu, Q. S., & Cao, J. D. (2009). A discrete-time recurrent neural network with one neuron for k-Winners-Take-All operation. In International symposium on neural networks (in press)
[21] Liu, Q.S.; Cao, J.D.; Xia, Y., A delayed neural network for solving linear projection equations and its analysis, IEEE transactions on neural networks, 16, 834-843, (2005)
[22] Liu, S.B.; Wang, J., A simplified dual neural network for quadratic programming with its KWTA application, IEEE transactions on neural networks, 17, 6, 1500-1510, (2006)
[23] Maass, W., On the computational power of winner-take-all, Neural computation, 12, 2519-2535, (2000)
[24] Marinov, C.A.; Hopfield, J., Stable computational dynamics for a class of circuits with \(O(n)\) interconnections capable of KWTA and rank extractions, IEEE transactions on circuits and systems, 52, 949-959, (2005) · Zbl 1374.94918
[25] Seraji, H.; Long, M.K.; Lee, T.S., Motion control of 7-DOF arms: the configuration control approach, IEEE transactions on robotics and automation, 4, 125-139, (1993)
[26] Solodov, M.V.; Tseng, P., Modified projection-type methods for monotone variational inequalities, SIAM journal on control and optimization, 2, 1814-1830, (1996) · Zbl 0866.49018
[27] Urahama, K.; Nagao, T., K-winner-take-all circuit with \(O(n)\) complexity, IEEE transactions on neural networks, 6, 776-778, (1995)
[28] Wolfe, W.J., K-winner networks, IEEE transactions on neural networks, 2, 310-315, (1991)
[29] Xia, Y.S., A new neural network for solving linear and quadratic programming problems, IEEE transactions on neural networks, 7, 1544-1547, (1996)
[30] Xia, Y. S. (2000). Design methodology and stability analysis of recurrent neural networks for constrained optimization. Ph.D thesis. The Chinese University of Hong Kong Press; Xia, Y. S. (2000). Design methodology and stability analysis of recurrent neural networks for constrained optimization. Ph.D thesis. The Chinese University of Hong Kong Press
[31] Xia, Y.S., An extended projection neural network for constrained optimization, Neural computation, 16, 4, 863-883, (2004) · Zbl 1097.68609
[32] Xia, Y.S.; Feng, G.; Wang, J., A primal-dual neural network for on-line resolving constrained kinematic redundancy in robot motion control, IEEE transactions on systems, man and cybernetics, part B (cybernetics), 35, 1, 54-64, (2005)
[33] Xia, Y.S.; Wang, J., A dual neural network for kinematic control of redundant robot manipulators, IEEE transactions on systems man and cybernetics, part B, 31, 147-154, (2001)
[34] Yoshikawa, T., Foundations of robotics: analysis and control, (1990), MIT Press Cambridge, MA
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.