On the resolution of misspecified convex optimization and monotone variational inequality problems
DOI10.1007/S10589-020-00193-ZzbMATH Open1447.90028arXiv1408.5532OpenAlexW3035847440MaRDI QIDQ782913FDOQ782913
Authors: Hesam Ahmadi, Uday V. Shanbhag
Publication date: 29 July 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.5532
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
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
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Lectures on Stochastic Programming
- Title not available (Why is that?)
- Gradient Convergence in Gradient methods with Errors
- Weak Sharp Minima in Mathematical Programming
- Title not available (Why is that?)
- Linear programming under uncertainty
- A dynamic near-optimal algorithm for online linear programming
- Title not available (Why is that?)
- The Multi-Armed Bandit Problem: Decomposition and Computation
- Title not available (Why is that?)
- 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 (2)
Uses Software
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)