Algorithm model for penalty functions-type iterative pcedures

DOI10.1016/S0022-0000(74)80035-8zbMath0298.65043OpenAlexW1991179397MaRDI QIDQ1214742

Gerard G. L. Meyer

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80035-8

Mathematics Subject Classification ID

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

Related Items (1)

Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed variational problems
• A systematic approach to the synthesis of algorithms
• Penalty Functions and Bounded Phase Coordinate Control
• Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
• Convergence Conditions for Nonlinear Programming Algorithms
• The Validity of a Family of Optimization Methods
• Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• Abstract Models for the Synthesis of Optimization Algorithms
• A Drivable Method of Feasible Directions
• On a Method of Courant for Minimizing Functionals
• Topologies on Spaces of Subsets

This page was built for publication: Algorithm model for penalty functions-type iterative pcedures