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

DOI10.1007/BF00249640MaRDI QIDQ1803652zbMATHOpenAlexFDO

Authors Dan Butnariu, Abraham Mehrez

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 examplegradient methoditerative algorithmsfeasibility problemsubgradient methodsystem of inequalitiesconvex intersection problemregularity pointsynchronized maximal-distance reduction

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

• On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions
• Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
• scientific article; zbMATH DE number 433002 (Why is no real title available?)
• Non-Convex feasibility problems and proximal point methods
• Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

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)