Sciweavers

32 search results - page 1 / 7
» An Inexact SQP Method for Equality Constrained Optimization
Sort
View
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 4 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
MP
2010
135views more  MP 2010»
13 years 2 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
VECPAR
2004
Springer
13 years 9 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
SIAMJO
2011
12 years 10 months ago
Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
We present a class of inexact adaptive multilevel trust-region SQP-methods for the efficient solution of optimization problems governed by nonlinear partial differential equations...
J. Carsten Ziems, Stefan Ulbrich
SIAMMAX
2010
113views more  SIAMMAX 2010»
12 years 11 months ago
Approximate Nullspace Iterations for KKT Systems
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gh...