Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP

Simple item page
dc.contributor.authorLawrence, Craig T.en_US
dc.contributor.authorTits, A.L.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:03:42Z
dc.date.available2007-05-23T10:03:42Z
dc.date.issued1997en_US
dc.description.abstractA sequential Quadratic Programming algorithm designed to efficiently solve nonlinear optimization problems with many inequality constraints, e.g. problems arising from finely discretized Semi-Infinite Programming, is described and analyzed. The key features of the algorithm are (i) that only a few of the constraints are used in the QP sub-problems at each iteration, and (ii) that every iterate satisfies all constraints.en_US
dc.format.extent1358116 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5849
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1997-12en_US
dc.subjectoptimal controlen_US
dc.subjectoptimizationen_US
dc.subjectIntelligent Control Systemsen_US
dc.titleFeasible Sequential Quadratic Programming for Finely Discretized Problems from SIPen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_97-12.pdf
Size:
1.3 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports