Extension of unconstrained minimization methods to linearly constrained problems

DOI10.1080/02331938408842929zbMath0556.90082OpenAlexW2014283319MaRDI QIDQ3220108

Wolfgang Schneiderheinze

Publication date: 1984

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938408842929

zbMATH Keywords

algorithmsunconstrained optimizationconvergence theoremslinearly constrained problems

Mathematics Subject Classification ID

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

Related Items (1)

A globally convergent version of a general recursive algorithm for nonlinear programming

This page was built for publication: Extension of unconstrained minimization methods to linearly constrained problems