Accuracy certificates for computational problems with convex structure
DOI10.1287/MOOR.1090.0427zbMATH Open1216.90067OpenAlexW2073403745WikidataQ57392900 ScholiaQ57392900MaRDI QIDQ3169082FDOQ3169082
Authors: Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum 
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1090.0427
Recommendations
convex minimizationconvexityvariational inequalitiessaddle pointscertificatescomputation in convex structuresconvex Nash equilibrium
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Computational aspects related to convexity (52B55) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (23)
- Primal-dual mirror descent method for constraint stochastic optimization problems
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- Inexact model: a framework for optimization and variational inequalities
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Solving variational inequalities with stochastic mirror-prox algorithm
- Subgradient ellipsoid method for nonsmooth convex problems
- On verified numerical computations in convex programming
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Numerical methods for the resource allocation problem in a computer network
- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks
- The proximal point algorithm revisited
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Title not available (Why is that?)
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
- Accelerated methods for saddle-point problem
- On well-structured convex–concave saddle point problems and variational inequalities with monotone operators
- Accuracy certificates for convex minimization with inexact oracle
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Signal recovery by stochastic optimization
This page was built for publication: Accuracy certificates for computational problems with convex structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169082)
