A derivative-free regularization algorithm for equality constrained nonlinear least squares problems
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911044959469568 |
|---|---|
| author | Chen, Xi Fan, Jinyan |
| author_facet | Chen, Xi Fan, Jinyan |
| contents | In this paper, we study the equality constrained nonlinear least squares problem, where the Jacobian matrices of the objective function and constraints are unavailable or expensive to compute. We approximate the Jacobian matrices via orthogonal spherical smoothing and propose a derivative-free regularization algorithm for solving the problem. At each iteration, a regularized augmented Lagrangian subproblem is solved to obtain a Newton-like step. If a sufficient decrease in the merit function of the approximate KKT system is achieved, the step is accepted, otherwise a derivative-free LM algorithm is applied to get another step to satisfy the sufficient decrease condition. It is shown that the algorithm either finds an approximate KKT point with arbitrary high probability or converges to a stationary point of constraints violation almost surely. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05623 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A derivative-free regularization algorithm for equality constrained nonlinear least squares problems Chen, Xi Fan, Jinyan Optimization and Control In this paper, we study the equality constrained nonlinear least squares problem, where the Jacobian matrices of the objective function and constraints are unavailable or expensive to compute. We approximate the Jacobian matrices via orthogonal spherical smoothing and propose a derivative-free regularization algorithm for solving the problem. At each iteration, a regularized augmented Lagrangian subproblem is solved to obtain a Newton-like step. If a sufficient decrease in the merit function of the approximate KKT system is achieved, the step is accepted, otherwise a derivative-free LM algorithm is applied to get another step to satisfy the sufficient decrease condition. It is shown that the algorithm either finds an approximate KKT point with arbitrary high probability or converges to a stationary point of constraints violation almost surely. |
| title | A derivative-free regularization algorithm for equality constrained nonlinear least squares problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.05623 |