3 papers
math.OC2026
Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
Xiaojun Chen, C. T. Kelley, Lei Wang
This paper studies the complexity of projected gradient descent methods for a class of strongly convex constrained optimization problems where the objective function is expressed a…
math.OC2025
A New Complexity Result for Strongly Convex Optimization with Locally -H{ö}lder Continuous Gradients
Xiaojun Chen, C. T. Kelley, Lei Wang
In this paper, we present a new complexity result for the gradient descent method with an appropriately fixed stepsize for minimizing a strongly convex function with locally -H…
math.OC2025
Robust Solutions of Nonlinear Least Squares Problems via Min-max Optimization
Xiaojun Chen, Carl Kelley
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…