On convergence properties of a least-distance programming procedure for minimization problems under linear constraints (Q1065717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convergence properties of a least-distance programming procedure for minimization problems under linear constraints |
scientific article; zbMATH DE number 3924524
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convergence properties of a least-distance programming procedure for minimization problems under linear constraints |
scientific article; zbMATH DE number 3924524 |
Statements
On convergence properties of a least-distance programming procedure for minimization problems under linear constraints (English)
0 references
1986
0 references
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.
0 references
least-distance programming procedure
0 references
linear constraints
0 references
quasiconvex functions
0 references
pseudoconvex functions
0 references
global convergence
0 references
convergence analysis
0 references
0 references
