Convergence properties of relaxation algorithms

DOI10.1007/BF02591858MaRDI QIDQ5187085zbMATH OpenOpenAlexFDO

Authors Gerard G. L. Meyer

Publication date 1985

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

anti-jamming procedurecoordinate descentcyclic relaxationNonadaptive relaxation algorithmsunconstrained optimizationunivariate search

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Convergence of relaxation algorithms by averaging
• Strong convergence analysis of the new relaxation nonmonotone line search algorithm
• scientific article; zbMATH DE number 4174671
• scientific article; zbMATH DE number 5926088
• A relaxed version of Bregman's method for convex programming

Cites work

• A Drivable Method of Feasible Directions
• An Efficient Method of Feasible Directions
• Composition and union of general algorithms of optimization
• Convergence Conditions for a Type of Algorithm Model
• Convergence Conditions for Nonlinear Programming Algorithms
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3540601 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3325981 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (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?)
• 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

(6)

• Convergence of relaxation algorithms by averaging
• Logarithmically convergent relaxation computation
• scientific article; zbMATH DE number 756188 (Why is no real title available?)
• On the relaxation parameters of MQ-algorithm
• Semi-convergence and relaxation parameters for a class of SIRT algorithms
• Relaxation in greedy approximation

This page was built for publication: Convergence properties of relaxation algorithms

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