Mathematical Programming · 2022 · 14 citations · 14 references
Natural SciencesComputer ScienceAlgorithmsOptimizationScientific ComputingConvex AnalysisConvex OptimizationGradient-based OptimizationNonlinear ProgrammingNumerical AlgorithmsVariational InequalitiesConvergence Rate AnalysisMinimizationMonotone Operator TheoryMonotone Variational InequalitiesNonsmooth Convex OptimizationSaddle Point OptimizationSaddle Point Problems
In this paper, we present a new ellipsoid-type algorithm for solving nonsmooth problems with convex structure. Examples of such problems include nonsmooth convex minimization problems, convex-concave saddle-point problems and variational inequalities with monotone operator. Our algorithm can be seen as a combination of the standard Subgradient and Ellipsoid methods. However, in contrast to the latter one, the proposed method has a reasonable convergence rate even when the dimensionality of the problem is sufficiently large. For generating accuracy certificates in our algorithm, we propose an efficient technique, which ameliorates the previously known recipes (Nemirovski in Math Oper Res 35(1):52-78, 2010).
14
Robust Stochastic Approximation Approach to Stochastic Programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan et al. · SIAM Journal on Optimization · 2009 · 2.1K citations
Primal-dual subgradient methods for convex problems
Yurii Nesterov · Mathematical Programming · 2007 · 858 citations