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

DOI10.1007/BF00249640zbMATH Open0777.65034OpenAlexW1971439118MaRDI QIDQ1803652FDOQ1803652

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

Recommendations

scientific article; zbMATH DE number 433002
On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions
Block-iterative surrogate projection methods for convex feasibility problems
Algorithms for the quasiconvex feasibility problem
Publication:3028739

zbMATH Keywords

convergence numerical example gradient method iterative algorithms feasibility problem subgradient method system of inequalities convex intersection problem regularity point synchronized maximal-distance reduction

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
Non-Convex feasibility problems and proximal point methods
Title not available (Why is that?)
Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803652)