Convergence of relaxation algorithms by averaging

DOI10.1007/BF01580731MaRDI QIDQ1105492zbMATH OpenOpenAlexFDO

Authors Gerard G. L. Meyer

Publication date 1988

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

averagingnondifferentiable optimizationsolution setAdaptive relaxation algorithmsnon-adaptive approachrelaxation algorithms

Mathematics Subject Classification ID

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

Recommendations

• Convergence properties of relaxation algorithms
• On combined relaxation methods' convergence rates
• Convergence of r-algorithms
• Publication:4867024
• Convergence of weighted averages of relaxed projections
• scientific article; zbMATH DE number 177992
• scientific article; zbMATH DE number 5005
• Conical averagedness and convergence analysis of fixed point algorithms
• A convergent relaxation of the Douglas-Rachford algorithm
• Geometric bounds for convergence rates of averaging algorithms

Cites work

• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3476451 (Why is no real title available?)
• scientific article; zbMATH DE number 3499503 (Why is no real title available?)
• scientific article; zbMATH DE number 3540601 (Why is no real title available?)
• scientific article; zbMATH DE number 3398693 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• Composition and union of general algorithms of optimization
• Convergence Conditions for Nonlinear Programming Algorithms
• Convergence Conditions for a Type of Algorithm Model
• Convergence properties of relaxation algorithms
• Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• On search directions for minimization algorithms
• Relaxation methods for linear equations

Cited in

(3)

• Logarithmically convergent relaxation computation
• Convergence properties of relaxation algorithms
• A reformulation-convexification approach for solving nonconvex quadratic programming problems

This page was built for publication: Convergence of relaxation algorithms by averaging

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