.png){kind=icon}
.png){kind=icon}
Return
Efficient Quadratic Penalization Through the Partial Minimization Technique
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2754474.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Common computational problems, such as parameter estimation in dynamic models and partial differential equation (PDE)-constrained optimization, require data fitting over a set of auxiliary parameters subject to physical constraints over an underlying state. Naive quadratically penalized formulations, commonly used in practice, suffer from inherent ill-conditioning. We show that surprisingly the partial minimization technique regularizes the problem, making it well-conditioned. This viewpoint sheds newlight on variable projection techniques, as well as the penalty method for PDE-constrained optimization, and motivates robust extensions. In addition, we outline an inexact analysis, showing that the partial minimization subproblem can be solved very loosely in each iteration. We illustrate the theory and algorithms on boundary control, optimal transport, and parameter estimation for robust dynamic inference.
Keywords:
Kalman smoothing
Nonconvex optimization
PDE constrained optimization
variable projection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W