1984
DOI: 10.1109/tcs.1984.1085482
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear programming without computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
85
0
4

Year Published

1987
1987
2016
2016

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 194 publications
(93 citation statements)
references
References 9 publications
0
85
0
4
Order By: Relevance
“…An important instance here is the gradient-descent algorithm (7) which reduces to (3) for (8) For quadratic , say, with is a two-contraction if Note that we do not change the gradient-descent algorithm; only the view point. Hence, the system is equivalent to those reported in [2], [7], [14], and [30] for quadratic programming. Fig.…”
Section: B Nonlinear Programmingmentioning
confidence: 99%
See 1 more Smart Citation
“…An important instance here is the gradient-descent algorithm (7) which reduces to (3) for (8) For quadratic , say, with is a two-contraction if Note that we do not change the gradient-descent algorithm; only the view point. Hence, the system is equivalent to those reported in [2], [7], [14], and [30] for quadratic programming. Fig.…”
Section: B Nonlinear Programmingmentioning
confidence: 99%
“…A transimpedance integrator provides a convenient method of realizing the term as the input to the dynamic element that computes the state variable If an ideal transconductor is used in conjunction with a capacitor a lossy integrator with finite time constant results. The ideal weighted solution for (1), in a small signal sense, is given by (14) with the proviso that remains within the linear range of the integrator (which is typically a few tens of millivolts). Fig.…”
Section: G Voltage Mode Dynamic Operator Implementationmentioning
confidence: 99%
“…showed that the Tank and Hopfield linear programming networ:k is a specific implementation of the canonical nonlinear programming circuit of Chua and Lin ( [5]) with a capacitor added to account for the dynamic behavior of the circuit. Kennedy and Chua ([9]) examined the stability of the modified canonical nonlinear programming circuit and proposed a neural network circuit implementation which could be utilized to solve a class of nonlinear programming prloblems.…”
Section: And Chua ([8])mentioning
confidence: 99%
“…Other canonical circuits were later introduced by Huertas, Rueda, Rodriguez-Vazquez and Chua ([4]). In [5], Chua and Lirl presented a circuit implementation which is capable of solving various progra,mming problerns without numerical computation. Later, Wilson ([6]) stressed the importance of negative components in quadratic programming and proposed an im.plementation which utilized floating negative resistors.…”
Section: Introductionmentioning
confidence: 99%
“…The ANNs are used to solve complex problems and to obtain solution of constrained optimization problems [19]. The canonical nonlinear programming circuit was developed by Chua and Lin [20]. In literature, ANNs are used in signal processing areas such as one [21] and two dimensional [22] filter design and image processing [23].…”
Section: Introductionmentioning
confidence: 99%