TY - JOUR

T1 - On the resolution of misspecified convex optimization and monotone variational inequality problems

AU - Ahmadi, Hesam

AU - Shanbhag, Uday V.

N1 - Funding Information:
H. Ahmadi, U. V. Shanbhag: Research has been partially funded by NSF Awards Nos. 1246887 (CAREER) and 1400217.
Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2020/9/1

Y1 - 2020/9/1

N2 - We consider a misspecified optimization problem, requiring the minimization of a function f(· ; θ∗) over a closed and convex set X where θ∗ is an unknown vector of parameters that may be learnt by a parallel learning process. Here, we develop coupled schemes that generate iterates (xk, θk) as k→ ∞, then xk→ x∗, a minimizer of f(· ; θ∗) over X and θk→ θ∗. In the first part of the paper, we consider the solution of problems where f is either smooth or nonsmooth. In smooth strongly convex regimes, we demonstrate that such schemes still display a linear rate of convergence, albeit with larger constants. When strong convexity assumptions are weakened, it can be shown that the convergence in function value sees a modification in the canonical convergence rate of O(1 / K) by an additive factor proportional to ‖ θ- θ∗‖ where ‖ θ- θ∗‖ represents the initial misspecification in θ∗. In addition, when the learning problem is assumed to be merely convex but admits a suitable weak-sharpness property, then the convergence rate deteriorates to O(1/K). In both convex and strongly convex regimes, diminishing steplength schemes are also provided and are less reliant on the knowledge of problem parameters. Finally, we present an averaging-based subgradient scheme that displays a rate of O(1/K)+O(‖θ0-θ∗‖(1/K)), implying no effect on the canonical rate of O(1/K). In the second part of the paper, we consider the solution of misspecified monotone variational inequality problems, motivated by the need to contend with more general equilibrium problems as well as the possibility of misspecification in the constraints. In this context, we first present a constant steplength misspecified extragradient scheme and prove its asymptotic convergence. This scheme is reliant on problem parameters (such as Lipschitz constants) and leads to a misspecified variant of iterative Tikhonov regularization, an avenue that does not necessitate the knowledge of such constants.

AB - We consider a misspecified optimization problem, requiring the minimization of a function f(· ; θ∗) over a closed and convex set X where θ∗ is an unknown vector of parameters that may be learnt by a parallel learning process. Here, we develop coupled schemes that generate iterates (xk, θk) as k→ ∞, then xk→ x∗, a minimizer of f(· ; θ∗) over X and θk→ θ∗. In the first part of the paper, we consider the solution of problems where f is either smooth or nonsmooth. In smooth strongly convex regimes, we demonstrate that such schemes still display a linear rate of convergence, albeit with larger constants. When strong convexity assumptions are weakened, it can be shown that the convergence in function value sees a modification in the canonical convergence rate of O(1 / K) by an additive factor proportional to ‖ θ- θ∗‖ where ‖ θ- θ∗‖ represents the initial misspecification in θ∗. In addition, when the learning problem is assumed to be merely convex but admits a suitable weak-sharpness property, then the convergence rate deteriorates to O(1/K). In both convex and strongly convex regimes, diminishing steplength schemes are also provided and are less reliant on the knowledge of problem parameters. Finally, we present an averaging-based subgradient scheme that displays a rate of O(1/K)+O(‖θ0-θ∗‖(1/K)), implying no effect on the canonical rate of O(1/K). In the second part of the paper, we consider the solution of misspecified monotone variational inequality problems, motivated by the need to contend with more general equilibrium problems as well as the possibility of misspecification in the constraints. In this context, we first present a constant steplength misspecified extragradient scheme and prove its asymptotic convergence. This scheme is reliant on problem parameters (such as Lipschitz constants) and leads to a misspecified variant of iterative Tikhonov regularization, an avenue that does not necessitate the knowledge of such constants.

UR - http://www.scopus.com/inward/record.url?scp=85086787026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85086787026&partnerID=8YFLogxK

U2 - 10.1007/s10589-020-00193-z

DO - 10.1007/s10589-020-00193-z

M3 - Article

AN - SCOPUS:85086787026

SN - 0926-6003

VL - 77

SP - 125

EP - 161

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

IS - 1

ER -