Algorithms for the quasiconvex feasibility problem

DOI10.1016/j.cam.2005.01.026zbMath1080.65047OpenAlexW2106719467MaRDI QIDQ2570027

Yair Censor, Alexander Segal

Publication date: 26 October 2005

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.01.026

zbMATH Keywords

convergencenormal conesubdifferentialquasiconvex feasibility problemssubgradient projections algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (17)

Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ A subgradient method for multiobjective optimization ⋮ Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces ⋮ A subgradient method for equilibrium problems involving quasiconvex bifunctions ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ Existence and uniqueness of maximal elements for preference relations: variational approach ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ A new hybrid iterative algorithm for variational inequalities ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Acceleration procedure for special classes of multi-extremal problems ⋮ Fixed point quasiconvex subgradient method ⋮ Adaptive subgradient method for the split quasi-convex feasibility problems ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Algorithms for quasiconvex minimization ⋮ Strong subdifferentials: theory and applications in nonconvex optimization ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications ⋮ An extension of the proximal point algorithm beyond convexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding common fixed points of a class of paracontractions
• Lower subdifferentiability of quadratic functions
• Lower subdifferentiable functions and their minimization by cutting planes
• Fractional programming by lower subdifferentiability techniques
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• A parallel subgradient projections method for the convex feasibility problem
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Quasiconvex optimization and location theory
• The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• Lower subdifferentiability in minimax fractional programming^*
• On Projection Algorithms for Solving Convex Feasibility Problems
• Block-Iterative Algorithms with Underrelaxed Bregman Projections
• On Convergence Properties of a Subgradient Method
• On systems of inequalities with convex functions in the left sides
• Minimization of unsmooth functionals
• Functional Operators (AM-22), Volume 2
• Convergence and efficiency of subgradient methods for quasiconvex minimization

This page was built for publication: Algorithms for the quasiconvex feasibility problem