Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Direct Method for Parabolic PDE Constrained Optimization ProblemsInexact Sequential Quadratic Programming

A Direct Method for Parabolic PDE Constrained Optimization Problems: Inexact Sequential Quadratic... [In this chapter we develop a novel approach for the solution of inequality constrained optimization problems. We first describe inexact Newton methods in Section 5.1 and investigate their local convergence in Section 5.2. In Section 5.3 we review strategies for the globalization of convergence and explain a different approach based on generalized level functions and monotonicity tests. An example in Section 5.4 illustrates the shortcomings of globalization strategies which are not based on the so called natural level function. We review the Restrictive Monotonicity Test (RMT) in Section 5.5 and propose a Natural Monotonicity Test (NMT) for Newton-type methods based on a Linear Iterative Splitting Approach (LISA). This combined approach allows for estimation of the critical constants which characterize convergence. We finally present how these results can be extended to global inexact SQP methods. We present efficient numerical solution techniques of the resulting sequence of Quadratic Programming Problems (QPs) in Chapters 8 and 9.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Direct Method for Parabolic PDE Constrained Optimization ProblemsInexact Sequential Quadratic Programming

Download PDF
41 pages

Loading next page...
 
/lp/springer-journals/a-direct-method-for-parabolic-pde-constrained-optimization-problems-70SwSpTZdh
Publisher
Springer Fachmedien Wiesbaden
Copyright
© Springer Fachmedien Wiesbaden 2014
ISBN
978-3-658-04475-6
Pages
33 –73
DOI
10.1007/978-3-658-04476-3_5
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter we develop a novel approach for the solution of inequality constrained optimization problems. We first describe inexact Newton methods in Section 5.1 and investigate their local convergence in Section 5.2. In Section 5.3 we review strategies for the globalization of convergence and explain a different approach based on generalized level functions and monotonicity tests. An example in Section 5.4 illustrates the shortcomings of globalization strategies which are not based on the so called natural level function. We review the Restrictive Monotonicity Test (RMT) in Section 5.5 and propose a Natural Monotonicity Test (NMT) for Newton-type methods based on a Linear Iterative Splitting Approach (LISA). This combined approach allows for estimation of the critical constants which characterize convergence. We finally present how these results can be extended to global inexact SQP methods. We present efficient numerical solution techniques of the resulting sequence of Quadratic Programming Problems (QPs) in Chapters 8 and 9.]

Published: Nov 30, 2013

Keywords: Newton Method; Global Convergence; Level Function; Jordan Block; Newton Step

There are no references for this article.