A systematic approach to the synthesis of algorithms

DOI10.1007/BF01397369zbMath0323.65022OpenAlexW2069832901MaRDI QIDQ1224412

Gerard G. L. Meyer

Publication date: 1975

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132344

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Algorithms in computer science (68W99)

Related Items (2)

Algorithm model for penalty functions-type iterative pcedures ⋮ Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes

Cites Work

• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• The Validity of a Family of Optimization Methods
• Topologies on Spaces of Subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A systematic approach to the synthesis of algorithms