A projected Lagrangian algorithm for semi-infinite programming

Simple item page
dc.contributor.authorCoope, Ian D.
dc.contributor.authorWatson, G. A.
dc.date.accessioned2015-07-27T23:53:58Z
dc.date.available2015-07-27T23:53:58Z
dc.date.issued1983en
dc.description.abstractA globally convergent algorithm is presented for the solution of a wide class of semi-infinite programming problems. The method is based on the solution of a sequence of equality constrained quadratic programming problems, and usually has a second order convergence rate. Numerical results illustrating the effectiveness of the method are given.en
dc.identifier.urihttp://hdl.handle.net/10092/10709
dc.language.isoen
dc.publisherUniversity of Canterbury. Mathematicsen
dc.relation.isreferencedbyNZCUen
dc.rightsCopyright Ian D. Coopeen
dc.rights.urihttps://canterbury.libguides.com/rights/thesesen
dc.subjectSemi-infinite programmingen
dc.subjectdescent algorithmen
dc.subjectpenalty functionen
dc.subjectLagrangian functionen
dc.subjectglobal convergenceen
dc.subjectsecond order convergenceen
dc.subject.anzsrcField of Research::01 - Mathematical Sciences::0101 - Pure Mathematicsen
dc.titleA projected Lagrangian algorithm for semi-infinite programmingen
thesis.degree.grantorUniversity of Canterburyen
thesis.degree.levelResearch Reporten
thesis.degree.nameResearch Reporten
uc.bibnumber133386en
uc.collegeFaculty of Engineeringen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
coope_watson_report_no32_1983.pdf
Size:
711.68 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Reports