A Bramble−Pasciak−like method with applications in optimization

Saddle-point systems arise in many applications areas, in fact in any situation where an extremum principle arises with constraints. The Stokes problem describing slow viscous flow of an incompressible fluid is a classic example coming from partial differential equations and in the area of Optimizat...

Full description

Bibliographic Details
Main Authors: Dollar, H, Gould, N, Stoll, M, Wathen, A
Format: Report
Published: Oxford University Computing Laboratory 2008
_version_ 1797062791373258752
author Dollar, H
Gould, N
Stoll, M
Wathen, A
author_facet Dollar, H
Gould, N
Stoll, M
Wathen, A
author_sort Dollar, H
collection OXFORD
description Saddle-point systems arise in many applications areas, in fact in any situation where an extremum principle arises with constraints. The Stokes problem describing slow viscous flow of an incompressible fluid is a classic example coming from partial differential equations and in the area of Optimization such problems are ubiquitous. In this manuscript we show how new approaches for the solution of saddle-point systems arising in Optimization can be derived from the Bramble-Pasciak Conjugate Gradient approach widely used in PDEs and more recent generalizations thereof. In particular we derive a class of new solution methods based on the use of Preconditioned Conjugate Gradients in non-standard inner products and demonstrate how these can be understood through more standard machinery. We show connections to Constraint Preconditioning and give the results of numerical computations on a number of standard Optimization test examples.
first_indexed 2024-03-06T20:50:35Z
format Report
id oxford-uuid:376c3288-0cd9-4210-b160-8ce35ff235ae
institution University of Oxford
last_indexed 2024-03-06T20:50:35Z
publishDate 2008
publisher Oxford University Computing Laboratory
record_format dspace
spelling oxford-uuid:376c3288-0cd9-4210-b160-8ce35ff235ae2022-03-26T13:44:03ZA Bramble−Pasciak−like method with applications in optimizationReporthttp://purl.org/coar/resource_type/c_93fcuuid:376c3288-0cd9-4210-b160-8ce35ff235aeDepartment of Computer ScienceOxford University Computing Laboratory2008Dollar, HGould, NStoll, MWathen, ASaddle-point systems arise in many applications areas, in fact in any situation where an extremum principle arises with constraints. The Stokes problem describing slow viscous flow of an incompressible fluid is a classic example coming from partial differential equations and in the area of Optimization such problems are ubiquitous. In this manuscript we show how new approaches for the solution of saddle-point systems arising in Optimization can be derived from the Bramble-Pasciak Conjugate Gradient approach widely used in PDEs and more recent generalizations thereof. In particular we derive a class of new solution methods based on the use of Preconditioned Conjugate Gradients in non-standard inner products and demonstrate how these can be understood through more standard machinery. We show connections to Constraint Preconditioning and give the results of numerical computations on a number of standard Optimization test examples.
spellingShingle Dollar, H
Gould, N
Stoll, M
Wathen, A
A Bramble−Pasciak−like method with applications in optimization
title A Bramble−Pasciak−like method with applications in optimization
title_full A Bramble−Pasciak−like method with applications in optimization
title_fullStr A Bramble−Pasciak−like method with applications in optimization
title_full_unstemmed A Bramble−Pasciak−like method with applications in optimization
title_short A Bramble−Pasciak−like method with applications in optimization
title_sort bramble pasciak like method with applications in optimization
work_keys_str_mv AT dollarh abramblepasciaklikemethodwithapplicationsinoptimization
AT gouldn abramblepasciaklikemethodwithapplicationsinoptimization
AT stollm abramblepasciaklikemethodwithapplicationsinoptimization
AT wathena abramblepasciaklikemethodwithapplicationsinoptimization
AT dollarh bramblepasciaklikemethodwithapplicationsinoptimization
AT gouldn bramblepasciaklikemethodwithapplicationsinoptimization
AT stollm bramblepasciaklikemethodwithapplicationsinoptimization
AT wathena bramblepasciaklikemethodwithapplicationsinoptimization