On well-structured convex–concave saddle point problems and variational inequalities with monotone operators
From MaRDI portal
Publication:5058386
DOI10.1080/10556788.2021.1928121OpenAlexW3183303133MaRDI QIDQ5058386
Arkadi Nemirovski, Anatoli B. Juditsky
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.01002
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A homogeneous model for monotone mixed horizontal linear complementarity problems
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- Solving asymmetric variational inequalities via convex optimization
- Lectures on Modern Convex Optimization
- General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Accuracy Certificates for Computational Problems with Convex Structure
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Statistical Inference via Convex Optimization
- Robust Portfolio Selection Problems