Algorithms for the quasiconvex feasibility problem (Q2570027)
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 2217858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the quasiconvex feasibility problem |
scientific article; zbMATH DE number 2217858 |
Statements
Algorithms for the quasiconvex feasibility problem (English)
0 references
26 October 2005
0 references
The possibilities of adapting some algorithmic approaches to solving the convex feasibility problem in order to become applicable to the quasiconvex feasibility problems (QFP) are investigated. Subgradient projections algorithms for this type of problems are taken into account. Different notions of subdifferentials are used to develop algorithms for the QFP for functions that are not necessarily differentiable, but have to satisfy a Lipschitz or a Hölder condition, which are needed for convergence.
0 references
normal cone
0 references
subdifferential
0 references
quasiconvex feasibility problems
0 references
subgradient projections algorithms
0 references
convergence
0 references
0 references
0 references
0.8310078382492065
0 references
0.822654664516449
0 references
0.8001850843429565
0 references
0.8001464009284973
0 references
