Algorithms for the quasiconvex feasibility problem (Q2570027): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2005.01.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106719467 / rank | |||
Normal rank | |||
Revision as of 00:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the quasiconvex feasibility problem |
scientific article |
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
