Quasi-optimization problems: existence, iterative algorithms and well-posedness (Q6952249)
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 8070481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-optimization problems: existence, iterative algorithms and well-posedness |
scientific article; zbMATH DE number 8070481 |
Statements
Quasi-optimization problems: existence, iterative algorithms and well-posedness (English)
0 references
28 July 2025
0 references
Scalar optimization problems whose constraints depend explicitly on the unknown solution, called here quasi-optimization problems, are considered in a Banach space setting. Several existence theorems are proved, and first-order optimality conditions are derived. Two iterative algorithms for obtaining a solution are described. Forms of (Levitin-Polyak like) well-posedness of such problems are considered and criteria for such properties are proved.
0 references
quasi-optimization problem
0 references
existence
0 references
well-posedness
0 references
iterative algorithm
0 references
sufficient and necessary condition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
