| Preface | p. vii |
| Nonlinear Least Squares | p. 1 |
| Nonlinear Inverse Problems: Examples and Difficulties | p. 5 |
| Example 1: Inversion of Knott-Zoeppritz Equations | p. 6 |
| An Abstract NLS Inverse Problem | p. 9 |
| Analysis of NLS Problems | p. 10 |
| Wellposedness | p. 10 |
| Optimizability | p. 12 |
| Output Least Squares Identifiability and Quadratically Wellposed Problems | p. 12 |
| Regularization | p. 14 |
| Derivation | p. 20 |
| Example 2: 1D Elliptic Parameter Estimation Problem | p. 21 |
| Example 3: 2D Elliptic Nonlinear Source Estimation Problem | p. 24 |
| Example 4: 2D Elliptic Parameter Estimation Problem | p. 26 |
| Computing Derivatives | p. 29 |
| Setting the Scene | p. 30 |
| The Sensitivity Functions Approach | p. 33 |
| The Adjoint Approach | p. 33 |
| Implementation of the Adjoint Approach | p. 38 |
| Example 1: The Adjoint Knott-Zoeppritz Equations | p. 41 |
| Examples 3 and 4: Discrete Adjoint Equations | p. 46 |
| Discretization Step 1: Choice of a Discretized Forward Map | p. 47 |
| Discretization Step 2: Choice of a Discretized Objective Function | p. 52 |
| Derivation Step 0: Forward Map and Objective Function | p. 52 |
| Derivation Step 1: State-Space Decomposition | p. 53 |
| Derivation Step 2: Lagrangian | p. 54 |
| Derivation Step 3: Adjoint Equation | p. 56 |
| Derivation Step 4: Gradient Equation | p. 58 |
| Examples 3 and 4: Continuous Adjoint Equations | p. 59 |
| Example 5: Differential Equations, Discretized Versus Discrete Gradient | p. 65 |
| Implementing the Discretized Gradient | p. 68 |
| Implementing the Discrete Gradient | p. 68 |
| Example 6: Discrete Marching Problems | p. 73 |
| Choosing a Parameterization | p. 79 |
| Calibration | p. 80 |
| On the Parameter Side | p. 80 |
| On the Data Side | p. 83 |
| Conclusion | p. 84 |
| How Many Parameters Can be Retrieved from the Data? | p. 84 |
| Simulation Versus Optimization Parameters | p. 88 |
| Parameterization by a Closed Form Formula | p. 90 |
| Decomposition on the Singular Basis | p. 91 |
| Multiscale Parameterization | p. 93 |
| Simulation Parameters for a Distributed Parameter | p. 93 |
| Optimization Parameters at Scale k | p. 94 |
| Scale-By-Scale Optimization | p. 95 |
| Examples of Multiscale Bases | p. 105 |
| Summary for Multiscale Parameterization | p. 108 |
| Adaptive Parameterization: Refinement Indicators | p. 108 |
| Definition of Refinement Indicators | p. 109 |
| Multiscale Refinement Indicators | p. 116 |
| Application to Image Segmentation | p. 121 |
| Coarsening Indicators | p. 122 |
| A Refinement/Coarsening Indicators Algorithm | p. 124 |
| Implementation of the Inversion | p. 126 |
| Constraints and Optimization Parameters | p. 126 |
| Gradient with Respect to Optimization Parameters | p. 129 |
| Maximum Projected Curvature: A Descent Step for Nonlinear Least Squares | p. 135 |
| Descent Algorithms | p. 135 |
| Maximum Projected Curvature (MPC) Step | p. 137 |
| Convergence Properties for the Theoretical MPC Step | p. 143 |
| Implementation of the MPC Step | p. 144 |
| Performance of the MPC Step | p. 148 |
| Output Least Squares Identifiability and Quadratically Wellposed NLS Problems | p. 161 |
| The Linear Case | p. 163 |
| Finite Curvature/Limited Deflection Problems | p. 165 |
| Identifiability and Stability of the Linearized Problems | p. 174 |
| A Sufficient Condition for OLS-Identifiability | p. 176 |
| The Case of Finite Dimensional Parameters | p. 179 |
| Four Questions to Q-Wellposedness | p. 182 |
| Case of Finite Dimensional Parameters | p. 183 |
| Case of Infinite Dimensional Parameters | p. 184 |
| Answering the Four Questions | p. 184 |
| Application to Example 2: ID Parameter Estimation with H1 Observation | p. 191 |
| Linear Stability | p. 193 |
| Deflection Estimate | p. 198 |
| Curvature Estimate | p. 199 |
| Conclusion: OLS-Identifiability | p. 200 |
| Application to Example 4: 2D Parameter Estimation, with H1 Observation | p. 200 |
| Regularization of Nonlinear Least Squares Problems | p. 209 |
| Levenberg-Marquardt-Tychonov (LMT) Regularization | p. 209 |
| Linear Problems | p. 211 |
| Finite Curvature/Limited Deflection (FC/LD) Problems | p. 219 |
| General Nonlinear Problems | p. 231 |
| Application to the Nonlinear 2D Source Problem | p. 237 |
| State-Space Regularization | p. 246 |
| Dense Observation: Geometric Approach | p. 248 |
| Incomplete Observation: Soft Analysis | p. 256 |
| Adapted Regularization for Example 4: 2D Parameter Estimation with H1 Observation | p. 259 |
| Which Part of a is Constrained by the Data? | p. 260 |
| How to Control the Unconstrained Part? | p. 262 |
| The Adapted-Regularized Problem | p. 264 |
| Infinite Dimensional Linear Stability and Deflection Estimates | p. 265 |
| Finite Curvature Estimate | p. 267 |
| OLS-Identifiability for the Adapted Regularized Problem | p. 268 |
| A Generalization of Convex Sets | p. 271 |
| Quasi-Convex Sets | p. 275 |
| Equipping the Set D with Paths | p. 277 |
| Definition and Main Properties of q.c. Sets | p. 281 |
| Strictly Quasi-Convex Sets | p. 299 |
| Definition and Main Properties of s.q.c. Sets | p. 300 |
| Characterization by the Global Radius of Curvature | p. 304 |
| Formula for the Global Radius of Curvature | p. 316 |
| Deflection Conditions for the Strict Quasi-convexity of Sets | p. 321 |
| The General Case: D ⊂ F | p. 327 |
| The Case of an Attainable Set D = ¿(C) | p. 337 |
| Bibliography | p. 345 |
| Index | p. 353 |
| Table of Contents provided by Ingram. All Rights Reserved. |