scientific article
From MaRDI portal
Publication:3967357
zbMath0501.90061MaRDI QIDQ3967357
Arkadi Nemirovski, D. B. Yudin
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergencegradient methodsproblem complexitysuboptimal methodssmooth convex problemsstrictly convex problemsconvex problems with stochastic disturbanceseffectiveness of optimization algorithmsmethod efficiency
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Methods of successive quadratic programming type (90C55)
Related Items
Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises, On risk concentration for convex combinations of linear estimators, Optimal solution of nonlinear equations, On Numerical Estimates of Errors in Solving Convex Optimization Problems, Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient, New results on subgradient methods for strongly convex optimization problems with a unified analysis, Complexity of fixed points. I, Proximity in concave integer quadratic programming, Efficient numerical methods for entropy-linear programming problems, Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case, A projection cutting plane algorithm for convex programming problems, Vaidya's method for convex stochastic optimization problems in small dimension, Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints, Primal-dual mirror descent method for constraint stochastic optimization problems, Gradient-free federated learning methods with \(l_1\) and \(l_2\)-randomization for non-smooth convex stochastic optimization problems, Reachability of optimal convergence rate estimates for high-order numerical convex optimization methods, Accelerated methods for weakly-quasi-convex optimization problems, An approximation algorithm for indefinite mixed integer quadratic programming, Unnamed Item, Numerical methods of Lyapunov function construction and their application to the absolute stability problem, Optimal Affine-Invariant Smooth Minimization Algorithms, Accelerated methods for saddle-point problem, Linear classifier and projection onto a polytope, Universal method for stochastic composite optimization problems, A version of the mirror descent method to solve variational inequalities, Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point, On the properties of the method of minimization for convex functions with relaxation on the distance to extremum, Accelerated gradient-free optimization methods with a non-Euclidean proximal operator, Algorithms of robust stochastic optimization based on mirror descent method, Accelerated directional search with non-Euclidean prox-structure, On approximation algorithms for concave mixed-integer quadratic programming, A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor, On adaptive and non-adaptive stochastic and deterministic algorithms, Adaptive Mirror Descent Algorithms for Convex and Strongly Convex Optimization Problems with Functional Constraints, Universal method of searching for equilibria and stochastic equilibria in transportation networks, Convergence of two-stage method with Bregman divergence for solving variational inequalities, An adaptive proximal method for variational inequalities, Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday), On efficient randomized algorithms for finding the PageRank vector, On the efficiency of a randomized mirror descent algorithm in online optimization problems
