A generalization of the gradient projection method to extremal problems with preconvex constraints. (Q1395322)
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 1940684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of the gradient projection method to extremal problems with preconvex constraints. |
scientific article; zbMATH DE number 1940684 |
Statements
A generalization of the gradient projection method to extremal problems with preconvex constraints. (English)
0 references
1 July 2003
0 references
In this paper the authors consider a generalization of a method designed for minimization of smooth functions for some cases of preconvex constraints. New numerical algorithms are presented, and their convergence in the sense of necessary extremal conditions is proved under some additional assumptions. The idea of the new method is that the projection problems on the iteration steps are solved for some auxiliary convex sets rather than for the initial set of constraints.
0 references
extremal problem
0 references
constraints
0 references
gradient projection method
0 references
preconvex set
0 references
convergence
0 references
0.8371981978416443
0 references
0.8352726101875305
0 references
