scientific article; zbMATH DE number 3540601

MaRDI QIDQ4116259zbMATH OpenFDO

Authors

Publication date 1970

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Convex programming (90C25) Nonlinear programming (90C30)

Cited in

(8)

• Convergence of relaxation algorithms by averaging
• Dynamic programming algorithm for optimizing distributed parameter trajectories with constraints
• A gradual rank increasing process for matrix completion
• Analyse numérique du champ magnetique d'un alternateur par éléments finis et sur-relaxation ponctuelle non linéaire
• A quadratically convergent method for minimizing a sum of euclidean norms
• Sur des méthodes d'optimisation par relaxation
• Convergence properties of relaxation algorithms
• A minimum norm approach for low-rank approximations of a matrix

This page was built for publication:

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