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

DOI10.1007/S10589-020-00193-ZzbMATH Open1447.90028arXiv1408.5532OpenAlexW3035847440MaRDI QIDQ782913FDOQ782913

Hesam Ahmadi, Uday V. Shanbhag

Publication date: 29 July 2020

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1408.5532

zbMATH Keywords

convex optimizationmisspecificationvariational inequality problems

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The elements of statistical learning. Data mining, inference, and prediction
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Theory and Applications of Robust Optimization
• First-order methods of smooth convex optimization with inexact oracle
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Uncertain convex programs: randomized solutions and confidence levels
• Lectures on Stochastic Programming
• Gradient Convergence in Gradient methods with Errors
• Weak Sharp Minima in Mathematical Programming
• Linear programming under uncertainty
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• The Multi-Armed Bandit Problem: Decomposition and Computation
• On the solution of stochastic optimization and variational problems in imperfect information regimes
• 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

Cited In (1)

• Stochastic approximation for multi-period simulation optimization with streaming input data

Uses Software

• ElemStatLearn

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)