Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation (Q1295958)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation |
scientific article; zbMATH DE number 1309158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation |
scientific article; zbMATH DE number 1309158 |
Statements
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation (English)
0 references
23 September 1999
0 references
interior-point methods
0 references
semidefinite programming
0 references
semidefinite linear complementarity problem
0 references
inexact computation
0 references
search direction
0 references
0.8485947847366333
0 references
0.8370531797409058
0 references
0.8290635347366333
0 references
0.8284600377082825
0 references
