Abstract
SummaryIn this paper, we propose a projection neural network model for solving convex quadratic multi‐objective optimization problem (CQMOP). The CQMOP is first converted into an equivalent convex nonlinear programming problem by the means of the weighted sum method, where the Pareto optimal solutions are calculated via different values of weights. A neural network model is then constructed for solving the obtained convex problem. It is shown that the presented neural network is stable in the sense of Lyapunov and is globally convergent. Simulation results are given to illustrate the global convergence and performance of the suggested model. Both theoretical and numerical approaches are studied. Numerical results are in good agreement with the proved theoretical concepts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Adaptive Control and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
