Transcription of Nonlinear Constrained Optimization: Methods and Software
{{id}} {{{paragraph}}}
ARGONNE NATIONAL LABORATORY9700 South Cass AvenueArgonne, Illinois 60439 Nonlinear Constrained optimization : Methods and SoftwareSven Leyffer and Ashutosh MahajanMathematics and Computer Science DivisionPreprint ANL/MCS-P1729-0310 March 17, 2010 This work was supported by the Office of Advanced Scientific Computing Research, Office of Science, Departmentof Energy, under Contract Background and Introduction12 Convergence Test and Termination Conditions23 Local Model: Improving a Solution Linear and Quadratic Programming .. Methods ..54 Globalization Strategy: Convergence from Remote Starting Lagrangian Methods .. and Merit Function Methods .. and Funnel Methods .. Effect and Loss of Fast Convergence .. 105 Globalization Methods .
Algorithms for NCOs are categorized by the choice they implement for each of these funda-mental components. In the next section, we review the fundamental building blocks of methods for nonlinearly constrained optimization. Notation: Throughout this paper, we denote iterates by x k;k= 1;2;:::, and we use subscripts to
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}