Iterative regularization of parameter identification problems by sequential quadratic programming methods

DOI10.1088/0266-5611/18/4/301zbMath1005.65124OpenAlexW2019082603MaRDI QIDQ3146253

Wolfram Mühlhuber, Martin Burger

Publication date: 27 October 2002

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/18/4/301

zbMATH Keywords

convergencenumerical experimentsparameter identificationiterative regularization methodssequential quadratic programming methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Inverse problems for PDEs (35R30) Methods of successive quadratic programming type (90C55) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21) Numerical solution to inverse problems in abstract spaces (65J22)

Related Items (11)

Discretization of parameter identification in PDEs using neural networks ⋮ A new practical framework for the stability analysis of perturbed saddle-point problems and applications ⋮ Regularization of inverse problems via box constrained minimization ⋮ A sequential quadratic Hamiltonian method for solving parabolic optimal control problems with discontinuous cost functionals ⋮ A combination of Kohn-Vogelius and DDM methods for a geometrical inverse problem ⋮ Minimization Based Formulations of Inverse Problems and Their Regularization ⋮ Parameter identification in Helmholtz-type equations with a variable coefficient using a regularized DRBEM ⋮ Parameter identification for fractional fractal diffusion model based on experimental data ⋮ Block triangular preconditioners for stabilized saddle point problems with nonsymmetric \((1,1)\)-block ⋮ The Tangential Cone Condition for Some Coefficient Identification Model Problems in Parabolic PDEs ⋮ Regularization Based on All-At-Once Formulations for Inverse Problems

This page was built for publication: Iterative regularization of parameter identification problems by sequential quadratic programming methods