A new generalized gradient projection type algorithm for linearly constrained problems (Q1355925)
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 new generalized gradient projection type algorithm for linearly constrained problems |
scientific article; zbMATH DE number 1014726
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new generalized gradient projection type algorithm for linearly constrained problems |
scientific article; zbMATH DE number 1014726 |
Statements
A new generalized gradient projection type algorithm for linearly constrained problems (English)
0 references
27 November 1997
0 references
For the nonlinear programming problem with linear constraints \[ \min\{f(x)/x\in X\},\text{ where }X=\{x\in\mathbb{R}^n/a^T_jx= b_j,j=1,\dots, r;a^T_jx\leq b_j, j=r+1,\dots,m\} \] a new generalized projection type algorithm is presented by using the concept of generalized projection matrix. Under weak assumptions the convergence of the generated sequence \(\{x^k\}\) to a Kuhn-Tucker-point is proved, but neither applications nor examples are given.
0 references
gradient projection type algorithm
0 references
nonlinear programming
0 references
linear constraints
0 references
projection matrix
0 references
convergence
0 references
0.8296836018562317
0 references
