Robust Stochastic Approximation Approach to Stochastic Programming
From MaRDI portal
Publication:3648521
DOI10.1137/070704277zbMath1189.90109OpenAlexW1992208280WikidataQ57392911 ScholiaQ57392911MaRDI QIDQ3648521
Alexander Shapiro, Guanghui Lan, Arkadi Nemirovski, Anatoli B. Juditsky
Publication date: 27 November 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/96167ed3ebc9a2c3270f6ae96043e6f086eed4de
Related Items
Stochastic distributed learning with gradient quantization and double-variance reduction, Block coordinate type methods for optimization and learning, Subgradient ellipsoid method for nonsmooth convex problems, Probability maximization via Minkowski functionals: convex representations and tractable resolution, An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians, Unifying mirror descent and dual averaging, Semi-discrete optimal transport: hardness, regularization and numerical solution, Robust optimization of control parameters for WEC arrays using stochastic methods, Privacy-preserving federated learning on lattice quantization, Improved variance reduction extragradient method with line search for stochastic variational inequalities, Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand, Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems, Unified analysis of stochastic gradient methods for composite convex and smooth optimization, Adaptive stochastic gradient descent for optimal control of parabolic equations with random parameters, Block Policy Mirror Descent, Parallel and distributed asynchronous adaptive stochastic gradient methods, Scaling up stochastic gradient descent for non-convex optimisation, A framework of convergence analysis of mini-batch stochastic projected gradient methods, A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints, A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems, Stochastic mirror descent method for linear ill-posed problems in Banach spaces, Variational Bayesian analysis of nonhomogeneous hidden Markov models with long and ultralong sequences, A stochastic variance reduction algorithm with Bregman distances for structured composite problems, Convergence rates of the stochastic alternating algorithm for bi-objective optimization, Stochastic composition optimization of functions without Lipschitz continuous gradient, Faster randomized block sparse Kaczmarz by averaging, Complexity analysis of a stochastic variant of generalized alternating direction method of multipliers, Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems, Limitations of neural network training due to numerical instability of backpropagation, Optimal analysis of method with batching for monotone stochastic finite-sum variational inequalities, Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization, Robust Accelerated Primal-Dual Methods for Computing Saddle Points, Variable sample-size operator extrapolation algorithm for stochastic mixed variational inequalities, Byzantine-robust loopless stochastic variance-reduced gradient, Optimal Algorithms for Stochastic Complementary Composite Minimization, A modified stochastic quasi-Newton algorithm for summing functions problem in machine learning, Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides, Theoretical analysis of Adam using hyperparameters close to one without Lipschitz smoothness, Distribution-free algorithms for predictive stochastic programming in the presence of streaming data, Nonlinear Gradient Mappings and Stochastic Optimization: A General Framework with Applications to Heavy-Tail Noise, Stochastic regularized Newton methods for nonlinear equations, Block mirror stochastic gradient method for stochastic optimization, A stochastic contraction mapping theorem, Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction, Stochastic Saddle Point Problems with Decision-Dependent Distributions, Stochastic Fixed-Point Iterations for Nonexpansive Maps: Convergence and Error Bounds, Statistical Analysis of Fixed Mini-Batch Gradient Descent Estimator, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, Reliable Error Estimates for Optimal Control of Linear Elliptic PDEs with Random Inputs, Numerical Analysis for Convergence of a Sample-Wise Backpropagation Method for Training Stochastic Neural Networks, Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games, Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization, GANs training: A game and stochastic control approach, Stochastic gradient descent: where optimization meets machine learning, Optimal Affine-Invariant Smooth Minimization Algorithms, Two stochastic optimization algorithms for convex optimization with fixed point constraints, Online Pairwise Learning Algorithms, Recent theoretical advances in decentralized distributed convex optimization, Codifferentials and Quasidifferentials of the Expectation of Nonsmooth Random Integrands and Two-Stage Stochastic Programming, Extragradient Method with Variance Reduction for Stochastic Variational Inequalities, Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization, Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand, An Empirical Interpolation and Model-Variance Reduction Method for Computing Statistical Outputs of Parametrized Stochastic Partial Differential Equations, An acceleration procedure for optimal first-order methods, Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, Scalable estimation strategies based on stochastic approximations: classical results and new insights, Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control, Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms, Privacy Aware Learning, On the Convergence of Mirror Descent beyond Stochastic Convex Programming, Asymptotic Results of Stochastic Decomposition for Two-Stage Stochastic Quadratic Programming, On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints, Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems, Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs, Some Limit Properties of Markov Chains Induced by Recursive Stochastic Algorithms, A fully stochastic second-order trust region method, Efficient numerical methods to solve sparse linear equations with application to PageRank, Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning, Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions, Stochastic Optimization for Dynamic Pricing, Stochastic approximation versus sample average approximation for Wasserstein barycenters, Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones, ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs, Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm, An Augmented Lagrangian Deep Learning Method for Variational Problems with Essential Boundary Conditions, Stochastic Learning Approach for Binary Optimization: Application to Bayesian Optimal Design of Experiments, Complexity Analysis of stochastic gradient methods for PDE-constrained optimal Control Problems with uncertain parameters, Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization, Graphical Convergence of Subgradients in Nonconvex Optimization and Learning, A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The Random Batch Method for N-Body Quantum Dynamics, An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization, On the Convergence of Stochastic Primal-Dual Hybrid Gradient, A stochastic gradient descent approach with partitioned-truncated singular value decomposition for large-scale inverse problems of magnetic modulus data, Online Learning with (Multiple) Kernels: A Review, Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems, Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes, Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty, The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence, Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation, On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING, Importance sampling in signal processing applications, Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, On the Adaptivity of Stochastic Gradient-Based Optimization, An Inverse-Adjusted Best Response Algorithm for Nash Equilibria, Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints, Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time, Optimization-Based Calibration of Simulation Input Models, Mitigating Interdiction Risk with Fortification, Online First-Order Framework for Robust Convex Optimization, A Stochastic Gradient Method With Mesh Refinement for PDE-Constrained Optimization Under Uncertainty, Stability and optimization error of stochastic gradient descent for pairwise learning, An Asymptotically Optimal Set Approach for Simulation Optimization, Unnamed Item, Unnamed Item, Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints, Unnamed Item, Unnamed Item, New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization, Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis, Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projection, Stochastic Subgradient Estimation Training for Support Vector Machines, Multidimensional stochastic approximation, Random Gradient Extrapolation for Distributed and Stochastic Optimization, Unnamed Item, Minimax Optimal Procedures for Locally Private Estimation, Faster Randomized Block Kaczmarz Algorithms, Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach, Optimal survey schemes for stochastic gradient descent with applications to M-estimation, Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures, Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities, Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation, Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand, Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees, Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems, Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces, Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity, Convergence Rate of Incremental Gradient and Incremental Newton Methods, Robust Power Management via Learning and Game Design, Subsampling Algorithms for Semidefinite Programming, Solving variational inequalities with Stochastic Mirror-Prox algorithm, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Sampled limited memory methods for massive linear inverse problems, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand, Unnamed Item, Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods, A Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation, On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms, Unnamed Item, Unnamed Item, Unnamed Item, On the Effectiveness of Richardson Extrapolation in Data Science, Unnamed Item, Distributed Bregman-Distance Algorithms for Min-Max Optimization, Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction, Proximal Gradient Methods for Machine Learning and Imaging, A deep learning algorithm for high-dimensional exploratory item factor analysis, An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, Stochastic gradient descent for semilinear elliptic equations with uncertainties, Understanding generalization error of SGD in nonconvex optimization, The CoMirror algorithm with random constraint sampling for convex semi-infinite programming, Stochastic forward-backward splitting for monotone inclusions, Stochastic accelerated alternating direction method of multipliers with importance sampling, Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis, A primal-dual algorithm for risk minimization, Berry-Esseen bounds for multivariate nonlinear statistics with applications to M-estimators and stochastic gradient descent algorithms, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints, Nonparametric stochastic approximation with large step-sizes, Optimal distributed stochastic mirror descent for strongly convex optimization, Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs, Online statistical inference for parameters estimation with linear-equality constraints, Distributed resource allocation over random networks based on stochastic approximation, Nonlinear stochastic programming-with a case study in continuous switching, Risk-balanced dimensioning and pricing of end-to-end differentiated services, Stochastic optimization using a trust-region method and random models, Riemannian stochastic fixed point optimization algorithm, Stochastic saddle-point optimization for the Wasserstein barycenter problem, Subgradient method for nonconvex nonsmooth optimization, Frameworks and results in distributionally robust optimization, On finite termination of an inexact proximal point algorithm, On the information-adaptive variants of the ADMM: an iteration complexity perspective, Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel, Stochastic mirror descent method for distributed multi-agent optimization, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Accelerated schemes for a class of variational inequalities, Individual confidence intervals for solutions to expected value formulations of stochastic variational inequalities, On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems, A mirror descent algorithm for minimization of mean Poisson flow driven losses, A new hybrid stochastic approximation algorithm, An optimal method for stochastic composite optimization, On stochastic gradient and subgradient methods with adaptive steplength sequences, Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market, On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes, Kullback-Leibler aggregation and misspecified generalized linear models, A sparsity preserving stochastic gradient methods for sparse regression, Learning in games with continuous action sets and unknown payoff functions, On variance reduction for stochastic smooth convex optimization with multiplicative noise, Saddle point mirror descent algorithm for the robust PageRank problem, Convergence conditions for the observed mean method in stochastic programming, A simultaneous perturbation stochastic approximation algorithm for coupled well placement and control optimization under geologic uncertainty, Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex, A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse, Minimizing finite sums with the stochastic average gradient, A continuous-time approach to online optimization, Aggregate subgradient method for nonsmooth DC optimization, Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures, Bayesian inference with optimal maps, Towards easier and faster sequence labeling for natural language processing: a search-based probabilistic online learning framework (SAPO), Surrogate-based robust design for a non-smooth radiation source detection problem, Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem, A primal sub-gradient method for structured classification with the averaged sum loss, Convergence of stochastic proximal gradient algorithm, Point process estimation with Mirror Prox algorithms, Distributed stochastic gradient tracking methods, Dynamic stochastic approximation for multi-stage stochastic optimization, Inexact stochastic mirror descent for two-stage nonlinear stochastic programs, Validation analysis of mirror descent stochastic approximation method, Optimality functions in stochastic programming, Introduction to convex optimization in financial markets, Robust inversion, dimensionality reduction, and randomized sampling, Saddle point approximation approaches for two-stage robust optimization problems, An optimal randomized incremental gradient method, On sample average approximation algorithms for determining the optimal importance sampling parameters in pricing financial derivatives on Lévy processes, Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces, Tutorial on risk neutral, distributionally robust and risk averse multistage stochastic programming, A Stochastic Quasi-Newton Method for Large-Scale Optimization, General convergence analysis of stochastic first-order methods for composite optimization, Stochastic intermediate gradient method for convex problems with stochastic inexact oracle, Gradient convergence of deep learning-based numerical methods for BSDEs, Fastest rates for stochastic mirror descent methods, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning, On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems, A stochastic primal-dual method for optimization with conditional value at risk constraints, Stochastic proximal splitting algorithm for composite minimization, Infinite-dimensional gradient-based descent for alpha-divergence minimisation, Unified binary generative adversarial network for image retrieval and compression, Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks, Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation, Analysis of stochastic gradient descent in continuous time, Consistent online Gaussian process regression without the sample complexity bottleneck, A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs, Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence, Distributionally robust optimization. A review on theory and applications, Stochastic heavy-ball method for constrained stochastic optimization problems, Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces, A PAC algorithm in relative precision for bandit problem with costly sampling, Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions, A study of data-driven distributionally robust optimization with incomplete joint data under finite support, A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization, A stochastic gradient algorithm with momentum terms for optimal control problems governed by a convection-diffusion equation with random diffusivity, On stochastic accelerated gradient with convergence rate, Two-stage linear decision rules for multi-stage stochastic programming, A hybrid stochastic optimization framework for composite nonconvex optimization, Accelerated gradient methods for nonconvex nonlinear and stochastic programming, On the Complexity of Random Satisfiability Problems with Planted Solutions, On sample size control in sample average approximations for solving smooth stochastic programs, Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints, Optimal order placement in limit order markets, Parallel stochastic gradient algorithms for large-scale matrix completion, Stochastic Methods for Composite and Weakly Convex Optimization Problems, A Level-Set Method for Convex Optimization with a Feasible Solution Path, Distributed Stochastic Approximation with Local Projections, A smoothing stochastic gradient method for composite optimization, Random gradient-free minimization of convex functions, Asymptotic optimality in stochastic optimization, Statistical inference for model parameters in stochastic gradient descent, Differentially private SGD with non-smooth losses, Two fast variance-reduced proximal gradient algorithms for SMVIPs -- stochastic mixed variational inequality problems with suitable applications to stochastic network games and traffic assignment problems, Swarming for Faster Convergence in Stochastic Optimization, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Algorithms for stochastic optimization with function or expectation constraints, Optimizing Adaptive Importance Sampling by Stochastic Approximation, Linear convergence of first order methods for non-strongly convex optimization, Primal-dual mirror descent method for constraint stochastic optimization problems, Some multivariate risk indicators: Minimization by using a Kiefer–Wolfowitz approach to the mirror stochastic algorithm, Optimization with Reference-Based Robust Preference Constraints, The subdifferential of measurable composite max integrands and smoothing approximation, Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization, Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties, Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization, On the convergence of asynchronous parallel iteration with unbounded delays, Stochastic AUC optimization with general loss, Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction, Bridging the gap between constant step size stochastic gradient descent and Markov chains, Risk bounds when learning infinitely many response functions by ordinary linear regression, Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes, On Sampling Rates in Simulation-Based Recursions, Sample average approximations of strongly convex stochastic programs in Hilbert spaces, On the Convergence of Gradient-Like Flows with Noisy Gradient Input, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, Stochastic Gradient Descent in Continuous Time, Randomized first order algorithms with applications to \(\ell _{1}\)-minimization, Penalty methods with stochastic approximation for stochastic nonlinear programming, Accelerated stochastic variance reduction for a class of convex optimization problems, A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization, Batched Stochastic Gradient Descent with Weighted Sampling, The asymptotics of ranking algorithms, Random Forward Models and Log-Likelihoods in Bayesian Inverse Problems, Generalized gradients in dynamic optimization, optimal control, and machine learning problems, Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities, Stochastic Model-Based Minimization of Weakly Convex Functions, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, Bi-fidelity stochastic gradient descent for structural optimization under uncertainty, String-averaging incremental stochastic subgradient algorithms, Why random reshuffling beats stochastic gradient descent, How Effectively Train Large-Scale Machine Learning Models?, Forward-reflected-backward method with variance reduction, On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling, A Central Limit Theorem and Hypotheses Testing for Risk-averse Stochastic Programs, Optimization Methods for Large-Scale Machine Learning, Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions, On the regularizing property of stochastic gradient descent, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization, Incrementally updated gradient methods for constrained and regularized optimization, Adaptive random search for continuous simulation optimization, Unnamed Item, Unnamed Item, Convergence of online mirror descent, Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants, A new convergent hybrid learning algorithm for two-stage stochastic programs, Cauchy noise loss for stochastic optimization of random matrix models via free deterministic equivalents, Algorithms of robust stochastic optimization based on mirror descent method, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Stochastic subgradient method converges on tame functions, A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions, Communication-efficient algorithms for decentralized and stochastic optimization, Faster subgradient methods for functions with Hölderian growth, A stochastic trust region method for unconstrained optimization problems, Lower error bounds for the stochastic gradient descent optimization algorithm: sharp convergence rates for slowly and fast decaying learning rates, Fast and strong convergence of online learning algorithms, Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches, On the linear convergence of the stochastic gradient method with constant step-size, Ergodic Convergence of a Stochastic Proximal Point Algorithm, Coordinate descent with arbitrary sampling I: algorithms and complexity†, A family of subgradient-based methods for convex optimization problems in a unifying framework, Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms, On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes, Online estimation of the asymptotic variance for averaged stochastic gradient algorithms, Adaptive Sampling for Incremental Optimization Using Stochastic Gradient Descent, Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization, Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression, Accelerating Stochastic Composition Optimization, Control variates for stochastic gradient MCMC, Random minibatch subgradient algorithms for convex problems with functional constraints, On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators, Unnamed Item, A non-monotonic method for large-scale non-negative least squares, A smooth penalty-based sample average approximation method for stochastic complementarity problems, Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization, On efficient randomized algorithms for finding the PageRank vector, On the efficiency of a randomized mirror descent algorithm in online optimization problems, Stochastic optimization on social networks with application to service pricing
Uses Software
