Convergence properties of relaxation algorithms

DOI10.1007/BF02591858zbMath0561.90078OpenAlexW2042572377MaRDI QIDQ5187085

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

unconstrained optimizationcoordinate descentcyclic relaxationunivariate searchanti-jamming procedureNonadaptive relaxation algorithms

Mathematics Subject Classification ID

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

Related Items

Convergence of relaxation algorithms by averaging

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• Relaxation methods for linear equations
• Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
• Convergence Conditions for a Type of Algorithm Model
• Composition and union of general algorithms of optimization
• An Efficient Method of Feasible Directions
• Convergence Conditions for Nonlinear Programming Algorithms
• A Drivable Method of Feasible Directions
• On search directions for minimization algorithms