Abstract | ||
---|---|---|
<P>An unconstrained minimization technique for solving nonlinear programming problems that involves no parameter selection is presented. The algorithm generates a sequence of interior feasible points with decreasing objective function values that converge to the optimum.</P> |
Year | DOI | Venue |
---|---|---|
1967 | 10.1287/opre.15.5.820 | Operations Research |
Keywords | Field | DocType |
nonlinear programming,theorems,algorithms,optimization | Mathematical optimization,Nonlinear programming,Minification,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 5 | 0030-364X |
Citations | PageRank | References |
6 | 6.38 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. V. Fiacco | 1 | 9 | 8.98 |
G. P. McCormick | 2 | 15 | 15.01 |