A Neurodynamic Optimization Approach to Bilevel Quadratic Programming
Authors:
- 19 August 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 28 (11) , 2580-2591
Abstract
This paper presents a neurodynamic optimization approach to bilevel quadratic programming (BQP). Based on the Karush-Kuhn-Tucker (KKT) theorem, the BQP problem is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). It is proved that the global solution of the MPCC is the minimal one of the optimal solutions to multiple convex optimization subproblems. A recurrent neural network is developed for solving these convex optimization subproblems. From any initial state, the state of the proposed neural network is convergent to an equilibrium point of the neural network, which is just the optimal solution of the convex optimization subproblem. Compared with existing recurrent neural networks for BQP, the proposed neural network is guaranteed for delivering the exact optimal solutions to any convex BQP problems. Moreover, it is proved that the proposed neural network for bilevel linear programming is convergent to an equilibrium point in finite time. Finally, three numerical examples are elaborated to substantiate the efficacy of the proposed approach.Keywords
Funding Information
- Research Grants Council, Hong Kong (416812)
- National Science Foundation of China (61273307, 61403101)
This publication has 51 references indexed in Scilit:
- On linear bilevel problems with multiple objectives at the lower levelOmega, 2011
- A neural network for solving a convex quadratic bilevel programming problemJournal of Computational and Applied Mathematics, 2010
- An overview of bilevel optimizationAnnals of Operations Research, 2007
- Interior-Point Algorithms, Penalty Methods and Equilibrium ProblemsComputational Optimization and Applications, 2006
- A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational ExperienceComputational Optimization and Applications, 2005
- Generalized Neural Network for Nonsmooth Nonlinear Programming ProblemsIEEE Transactions on Circuits and Systems I: Regular Papers, 2004
- A Novel Neural Network for Nonlinear Convex ProgrammingIEEE Transactions on Neural Networks, 2004
- A new gradient-based neural network for solving linear and quadratic programming problemsIEEE Transactions on Neural Networks, 2001
- Bilevel programming in traffic planning: Models, methods and challengeJournal of Global Optimization, 1995
- Neural networks for nonlinear programmingIEEE Transactions on Circuits and Systems, 1988