Robust solutions of nonlinear least squares problems via min-max optimization

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 $\varepsilon $ minimax critical point of the min-max problem needs at most $O(\varepsilon ^{-2} +\delta ^{2} \varepsilon ^{-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 behavior of least squares solutions disregarding uncertainties in the data.

Authors

Institutions

Publication Details

Journal
IMA Journal of Numerical Analysis
Published
2025-05-16
DOI
https://doi.org/10.1093/imanum/draf026
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust solutions of nonlinear least squares problems via min-max optimization

C. T. Kelley, Xiaojun Chen
IMA Journal of Numerical Analysis
Advanced Optimization Algorithms Research
article

Robust solutions of nonlinear least squares problems via min-max optimization

C. T. Kelley, Xiaojun Chen
article en

Abstract

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 $\varepsilon $ minimax critical point of the min-max problem needs at most $O(\varepsilon ^{-2} +\delta ^{2} \varepsilon ^{-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 behavior of least squares solutions disregarding uncertainties in the data.

IMA Journal of Numerical Analysis
North Carolina State University (US), Hong Kong Polytechnic University (HK)
National Science Foundation, National Key Research and Development Program of China
Openalex Percentile: Top 84%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Robust solutions of nonlinear least squares problems via min-max optimization — C. T. Kelley, Xiaojun Chen · IMA Journal of Numerical Analysis (2025) | TGRS Research Map | TGRS