Convergence of relaxation algorithms by averaging

DOI10.1007/BF01580731zbMath0648.90069OpenAlexW1985072078MaRDI QIDQ1105492

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

solution setnondifferentiable optimizationaveragingAdaptive relaxation algorithmsnon-adaptive approachrelaxation algorithms

Mathematics Subject Classification ID

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

Related Items

A reformulation-convexification approach for solving nonconvex quadratic programming problems

Cites Work

• 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
• Convergence properties of relaxation algorithms
• Convergence Conditions for Nonlinear Programming Algorithms
• On search directions for minimization algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item