2011
DOI: 10.1016/j.apm.2010.10.001
|View full text |Cite
|
Sign up to set email alerts
|

A novel recurrent nonlinear neural network for solving quadratic programming problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(8 citation statements)
references
References 9 publications
0
8
0
Order By: Relevance
“…To solve the above optimisation problem effectively, (23) is formulated in terms of the Lagrangian dual problem form [38] and is given as right leftthickmathspace.5eminfα12normalΔUkTbold-italicQ1normalΔUk+Q2normalΔUk+α)(HknormalΔUkGknormalsubjectednormalto:α0 The objective function in (24) is strictly convex for given normalΔU. Thus, the minimum value is obtained by finding the derivation of (24) with respect to normalΔU and is given by bold-italicQ1normalΔUk+Q2+HnormalTα=0 A unique solution to (25) is thus given as normalΔUk=bold-italicQ11false(Q2+HnormalTαfalse) Using the expression normalΔU from (26) in (24), one obtains truemaxα)(12αTλ1α+αλ212Q2normalTbold-italicQ11Q2 …”
Section: Control Law Formulationmentioning
confidence: 99%
“…To solve the above optimisation problem effectively, (23) is formulated in terms of the Lagrangian dual problem form [38] and is given as right leftthickmathspace.5eminfα12normalΔUkTbold-italicQ1normalΔUk+Q2normalΔUk+α)(HknormalΔUkGknormalsubjectednormalto:α0 The objective function in (24) is strictly convex for given normalΔU. Thus, the minimum value is obtained by finding the derivation of (24) with respect to normalΔU and is given by bold-italicQ1normalΔUk+Q2+HnormalTα=0 A unique solution to (25) is thus given as normalΔUk=bold-italicQ11false(Q2+HnormalTαfalse) Using the expression normalΔU from (26) in (24), one obtains truemaxα)(12αTλ1α+αλ212Q2normalTbold-italicQ11Q2 …”
Section: Control Law Formulationmentioning
confidence: 99%
“…However, if the system is mildly nonlinear, a linearized model (such as the one proposed in this paper) can be used to obtain suboptimal control laws in real-time using quadratic programming. Also, when the quadratic programming (QP) subproblem (22) is strictly convex, a more efficient and fast QP algorithm can be used (Effati and Ranjbar, 2011). The fast QP algorithm is derived as follows.…”
Section: Mpc Optimization Problemmentioning
confidence: 99%
“…Thereafter, the neural networks for solving different kinds of quadratic programming problems have been studied extensively and significant research results have been achieved [11][12][13][14][15][16]. For example, Kennedy and Chua [11] presented a neural network which contains finite penalty parameters and generates approximate solution for solving nonlinear programming problems.…”
Section: Introductionmentioning
confidence: 99%
“…Based on projection methods, several projection neural networks [17,18] were used for solving linear and quadratic programming problems, their approaches which deal with inequality constraints indirectly convert the inequality constraints into equality constraints by adding slack or surplus variables. By utilizing the Lagrangian coefficients, Effati and Ranjbar [14] proposed a new neural network model with a simple form and a less number calculation operation.…”
Section: Introductionmentioning
confidence: 99%