Algorithms for the quasiconvex feasibility problem

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

Citing 10
Cited 1

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

A subgradient method for multiobjective optimization

Computational Optimization and Applications

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^*@?R^n that satisfies the inequalities f"1(x^*)=