arXiv Analytics

Sign in

arXiv:2402.12679 [math.OC]AbstractReferencesReviewsResources

Robust Solutions of Nonlinear Least Squares Problems via Min-max Optimization

Xiaojun Chen, Carl Kelley

Published 2024-02-20, updated 2025-01-31Version 2

This paper considers robust solutions to a class of nonlinear least squares problems using min-max optimization approach. We give an explicit formula for the value function of the inner maximization problem and show the existence of global minimax points. We establish error bounds from any solution of the nonlinear least squares problem to the solution set of the robust nonlinear least squares problem. Moreover, we propose a smoothing method for finding a global minimax point of the min-max problem by using the formula and show that finding an $\epsilon$ minimax critical point of the min-max problem needs at most $O(\epsilon^{-2} +\delta^2 \epsilon^{-3})$ evaluations of the function value and gradients of the objective function, where $\delta$ is the tolerance of the noise. Numerical results of integral equations with uncertain data demonstrate the robustness of solutions of our approach and unstable behaviour of least squares solutions disregarding uncertainties in the data.

Related articles: Most relevant | Search more
arXiv:1402.3095 [math.OC] (Published 2014-02-13)
Robust Solutions to Multi-Objective Linear Programs with Uncertain Data
arXiv:1810.11972 [math.OC] (Published 2018-10-29)
A fast algorithm for globally solving Tikhonov regularized total least squares problem
arXiv:1904.05460 [math.OC] (Published 2019-04-10)
Least Squares Auto-Tuning