THE SEQUENTIAL UNCONSTRAINED MINIMIZATION TECHNIQUE FOR CONVEX PROGRAMMING WITH EQUALITY CONSTRAINTS.

reportActive / Technical Report | Accession Number: AD0623093 | Need Help?

Abstract:

This paper extends the sequential unconstrained minimization technique for nonlinear programming to include problems where the constraints are a mixture of inequalities and equalities. Theorems indicating the dual nature of the method and the solution of a subproblem are given. Finally, the theoretical basis for a k-point extrapolation procedure is established. Author

Author(s):
Fiacco, Anthony V. ; Mccormick, Garth P.
Author Organization(s):
RESEARCH ANALYSIS CORP MCLEAN VA
Descriptive Note:
Technical paper,
Supplementary Note:
See also PB-167 599.
Annotation:
Sequential unconstrained minimization technique for convex programming with equality constraints.
Pagination:
0026

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
RAC-TP-155
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*SEQUENCES(MATHEMATICS), SEQUENTIAL ANALYSIS, NONLINEAR PROGRAMMING, FUNCTIONS(MATHEMATICS), VECTOR ANALYSIS, TAYLORS SERIES
Report Date:
1965 Apr 01