Skip to main navigation Skip to search Skip to main content

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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

Abstract

This paper considers robust solutions to a class of nonlinear least squares problems using a 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 (Formula presented) minimax critical point of the min-max problem needs at most (Formula presented) evaluations of the function value and gradients of the objective function, where (Formula presented) is the tolerance of the noise. Numerical results of integral equations with uncertain data demonstrate the robustness of solutions of our approach and unstable behavior of least squares solutions disregarding uncertainties in the data.

Original languageEnglish
Pages (from-to)1356-1382
Number of pages27
JournalIMA Journal of Numerical Analysis
Volume46
Issue number3
DOIs
Publication statusPublished - May 2026

Keywords

  • complexity
  • min-max optimization
  • nonlinear least squares problems
  • nonsmooth nonconvex optimization
  • numerical solution of integral equations

ASJC Scopus subject areas

  • General Mathematics
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Robust Solutions of Nonlinear Least Squares Problems via Min-max Optimization'. Together they form a unique fingerprint.

Cite this