A Generalized Trust Region Algorithm for Equality Constrained Optimization

dc.contributor.authorWang, Zhenen_US
dc.date.accessioned2018-06-18T17:51:08Zen_US
dc.date.available2018-06-18T17:51:08Zen_US
dc.date.issued2003-12en_US
dc.date.noteDecember 2003 (Submitted November 2003)en_US
dc.descriptionThis work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18720en_US
dc.description.abstractWe introduce and analyze a class of generalized trust region sequential quadratic programming (GTRSQP) algorithms for equality constrained optimization. Unlike in standard trust region SQP (TRSQP) algorithms, the optimization subproblems arising in our GTRSQP algorithm can be generated from models of the objective and constraint functions that are not necessarily based on Taylor approximations. The need for such generalizations is motivated by optimal control problems for which model problems can be generated using, e.g., different discretizations. Several existing TRSQP algorithms are special cases of our GTRSQP algorithm. Our first order global convergence result for the GTRSQP algorithm applied to TRSQP allows one to relax the condition that the so-called tangential step lies in the null-space of the linearized constraints. The application of the GTRSQP algorithm to an optimal control problem governed by Burgers equation is discussed.en_US
dc.format.extent123 ppen_US
dc.identifier.citationWang, Zhen. "A Generalized Trust Region Algorithm for Equality Constrained Optimization." (2003) <a href="https://hdl.handle.net/1911/102014">https://hdl.handle.net/1911/102014</a>.en_US
dc.identifier.digitalTR03-18en_US
dc.identifier.urihttps://hdl.handle.net/1911/102014en_US
dc.language.isoengen_US
dc.titleA Generalized Trust Region Algorithm for Equality Constrained Optimizationen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR03-18.pdf
Size:
577.13 KB
Format:
Adobe Portable Document Format