Generalization of Murty's direct algorithm to linear and convex quadratic programming (Q1106739)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4062855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization of Murty's direct algorithm to linear and convex quadratic programming |
scientific article; zbMATH DE number 4062855 |
Statements
Generalization of Murty's direct algorithm to linear and convex quadratic programming (English)
0 references
1989
0 references
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.
0 references
Murty's algorithm
0 references
optimality conditions
0 references
convex quadratic programming
0 references
equality and inequality constraints
0 references
error control
0 references
0.8095249533653259
0 references
0.8054186105728149
0 references
0.8019880652427673
0 references
0.7993009686470032
0 references
