Algorithms for the quasiconvex feasibility problem

Authors:
Yair Censor;Alexander Segal
Affiliations:
Department of Mathematics, University of Haifa, Haifa, Israel;Department of Mathematics, University of Haifa, Haifa, Israel
Venue:
Journal of Computational and Applied Mathematics
Year:
2006

Citing 10
Cited 0

Minimization methods for non-differentiable functions

Minimization methods for non-differentiable functions
A parallel subgradient projections method for the convex feasibility problem

Journal of Computational and Applied Mathematics
The minimization of lower subdifferentiable functions under nonlinear constraints: an all feasible cutting plane algorithm

Journal of Optimization Theory and Applications
Parallel application of block-iterative methods in medical imaging and radiation therapy

Mathematical Programming: Series A and B
Fractional programming by lower subdifferentiability techniques

Journal of Optimization Theory and Applications
Lower subdifferentiability of quadratic functions

Mathematical Programming: Series A and B
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Parallel Optimization: Theory, Algorithms and Applications

Parallel Optimization: Theory, Algorithms and Applications
Block-Iterative Algorithms with Underrelaxed Bregman Projections

SIAM Journal on Optimization
The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs

INFORMS Journal on Computing

Quantified Score

Hi-index	7.29

Visualization

Abstract

We study the behavior of subgradient projections algorithms for the quasiconvex feasibility problem of finding a point x* ∈ Rn that satisfies the inequalities f1(x*)≤0, f2(x*)≤0,..., fm(x*)≤0, where all functions are continuous and quasiconvex. We consider the consistent case when the solution set is nonempty. Since the Fenchel-Moreau subdifferential might be empty we look at different notions of the subdifferential and determine their suitability for our problem. We also determine conditions on the functions, that are needed for convergence of our algorithms. The quasiconvex functions on the left-hand side of the inequalities need not be differentiable but have to satisfy a Lipschitz or a Hölder condition.