A least-distance programming procedure for minimization problems under linear constraints (Q1170113)
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: A least-distance programming procedure for minimization problems under linear constraints |
scientific article; zbMATH DE number 3782746
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A least-distance programming procedure for minimization problems under linear constraints |
scientific article; zbMATH DE number 3782746 |
Statements
A least-distance programming procedure for minimization problems under linear constraints (English)
0 references
1983
0 references
linear constraints
0 references
Lemke's complementary pivoting algorithm
0 references
Cholesky's factorization
0 references
Armijo's inexact line search
0 references
computational testing
0 references
global convergence
0 references
solution algorithms
0 references
0 references
