2004
DOI: 10.1016/j.neunet.2003.07.006
|View full text |Cite
|
Sign up to set email alerts
|

Neural networks for nonlinear and mixed complementarity problems and their applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 30 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…We compare our neural network model with some existing models which also work for NCP, for instance, the ones used in [6,31,32]. At first glance, the neural network models based on projection in [6,31,32] look having lower complexity.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…We compare our neural network model with some existing models which also work for NCP, for instance, the ones used in [6,31,32]. At first glance, the neural network models based on projection in [6,31,32] look having lower complexity.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…At first glance, the neural network models based on projection in [6,31,32] look having lower complexity. However, we observe that the difference of the numerical performance is very marginal by testing MCPLIB benchmark problems.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…When SOCCVI problem corresponds to the KKT conditions of a convex secondorder cone program (CSOCP) problem as (4) where both h and g are linear, the above Proposition 3.1 Let : R 1+n+l+m → R + be defined as in (9). Then, (w) ≥ 0 for w = (ε, x, μ, λ) ∈ R 1+n+l+m and (w) = 0 if and only if (x, μ, λ) solves the KKT system (5).…”
Section: Remark 31mentioning
confidence: 99%