NE/SQP: A robust algorithm for the nonlinear complementarity problem (Q689133): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01580617 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050864977 / rank | |||
Normal rank | |||
Latest revision as of 11:17, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NE/SQP: A robust algorithm for the nonlinear complementarity problem |
scientific article |
Statements
NE/SQP: A robust algorithm for the nonlinear complementarity problem (English)
0 references
15 March 1995
0 references
nonsmooth equations
0 references
successive quadratic programming
0 references
nonlinear complementarity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
