On the resolution of misspecified convex optimization and monotone variational inequality problems
From MaRDI portal
(Redirected from Publication:782913)
Abstract: We consider a misspecified optimization problem that requires minimizing a function f(x;q*) over a closed and convex set X where q* is an unknown vector of parameters that may be learnt by a parallel learning process. In this context, We examine the development of coupled schemes that generate iterates {x_k,q_k} as k goes to infinity, then {x_k} converges x*, a minimizer of f(x;q*) over X and {q_k} converges to q*. In the first part of the paper, we consider the solution of problems where f is either smooth or nonsmooth under various convexity assumptions on function f. In addition, rate statements are also provided to quantify the degradation in rate resulted from learning process. In the second part of the paper, we consider the solution of misspecified monotone variational inequality problems to contend with more general equilibrium problems as well as the possibility of misspecification in the constraints. 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 us to present a misspecified variant of iterative Tikhonov regularization. Numerics support the asymptotic and rate statements.
Recommendations
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
- scientific article; zbMATH DE number 3846336
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Convergence rate analysis of iteractive algorithms for solving variational inequality problems
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 895182 (Why is no real title available?)
- A dynamic near-optimal algorithm for online linear programming
- Close the gaps: a learning-while-doing algorithm for single-product revenue management problems
- Distributed Computation of Equilibria in Misspecified Convex Stochastic Nash Games
- Distributed computation of equilibria in monotone Nash games via iterative regularization techniques
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods of smooth convex optimization with inexact oracle
- Gradient Convergence in Gradient methods with Errors
- Lectures on Stochastic Programming
- Linear programming under uncertainty
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Robust optimization
- The Multi-Armed Bandit Problem: Decomposition and Computation
- The elements of statistical learning. Data mining, inference, and prediction
- Theory and applications of robust optimization
- Uncertain convex programs: randomized solutions and confidence levels
- Weak Sharp Minima in Mathematical Programming
Cited in
(2)
This page was built for publication: On the resolution of misspecified convex optimization and monotone variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782913)
