Show simple item record

dc.contributor.advisorKodres, U.R.
dc.contributor.authorLeahy, Vincent J.
dc.date.accessioned2012-08-09T19:32:25Z
dc.date.available2012-08-09T19:32:25Z
dc.date.issued1966-06
dc.identifier.urihttp://hdl.handle.net/10945/9585
dc.description.abstractThe Sequential Unconstrained Minimization Technique (SUMT) for Convex Programming Problems is modified by the introduction of an exponent in the penalty term. The exponent is introduced to increase the rate of convergence of the method for nonlinear problems with solutions on the boundary of one or more constraints. Convergence to the solution of the constrained problem is proved, and it is shown that SUMT is a special case of the general unconstrained function with the exponent equal to one. Results of a sample problem indicate that the rate of convergence is improved and that the computational time for solution is decreased for an exponent less than one.en_US
dc.description.urihttp://www.archive.org/details/modifiedpenaltyt00leah
dc.language.isoen_US
dc.publisherMonterey, California. U.S. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.subject.lcshMathematicsen_US
dc.titleA modified penalty term for the sequential unconstrained minimization technique for convex programming problemsen_US
dc.typeThesisen_US
dc.description.serviceLieutenant Commander, United States Navyen_US
etd.thesisdegree.nameM.S. in Mathematicsen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineMathematicsen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record