Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems

DOI10.1007/BF00249640zbMath0777.65034OpenAlexW1971439118MaRDI QIDQ1803652

Abraham Mehrez, Dan Butnariu

Publication date: 29 June 1993

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00249640

zbMATH Keywords

convergencenumerical examplesubgradient methoditerative algorithmsgradient methodfeasibility problemsystem of inequalitiesconvex intersection problemregularity pointsynchronized maximal-distance reduction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces ⋮ Non-Convex feasibility problems and proximal point methods ⋮ Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• A simultaneous projections method for linear inequalities
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• Error bounds for the method of alternating projections
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• An inexact algorithm for composite nondifferentiable optimization
• On rings of operators. Reduction theory
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Optimization and nonsmooth analysis
• The Minisum and Minimax Location Problems Revisited
• Optimal design of efficient acoustic antenna arrays
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• Cyclic subgradient projections
• Optimization Problems Subject to a Budget Constraint with Economies of Scale
• On convergence rates of subgradient optimization methods
• Generalized Image Restoration by the Method of Alternating Orthogonal Projections
• Optimization of lipschitz continuous functions
• Another Proof that Convex Functions are Locally Lipschitz
• Convex Analysis
• The method of projections for finding the common point of convex sets
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems