On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
From MaRDI portal
(Redirected from Publication:1065717)
Recently, \textit{M. S. Bazaraa} and \textit{J. J. Goode} [ibid. 40, 489-514 (1983; Zbl 0496.90066)] provided an algorithm for solving a nonlinear programming problem with linear constraints. In this paper, we show that this algorithm possesses good convergence properties.
Recommendations
Cites work
Cited in
(4)- Global convergence of a modified gradient projection method for convex constrained problems
- scientific article; zbMATH DE number 4066637 (Why is no real title available?)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- Convergence of a projected gradient method variant for quasiconvex objectives
This page was built for publication: On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065717)