scientific article
From MaRDI portal
Publication:3967358
zbMath0501.90062MaRDI QIDQ3967358
Arkadi Nemirovski, D. B. Yudin
Publication date: 1983
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 (only showing first 100 items - show all)
Universal Conditional Gradient Sliding for Convex Optimization ⋮ Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ Approximate Newton Policy Gradient Algorithms ⋮ Efficient second-order optimization with predictions in differential games ⋮ Information complexity of mixed-integer convex optimization ⋮ A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem ⋮ Accelerated gradient methods with absolute and relative noise in the gradient ⋮ Practical perspectives on symplectic accelerated optimization ⋮ Non-asymptotic analysis and inference for an outlyingness induced winsorized mean ⋮ Block Policy Mirror Descent ⋮ Learning with risks based on M-location ⋮ A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems ⋮ Stochastic mirror descent method for linear ill-posed problems in Banach spaces ⋮ Stochastic composition optimization of functions without Lipschitz continuous gradient ⋮ Faster randomized block sparse Kaczmarz by averaging ⋮ Smooth over-parameterized solvers for non-smooth structured optimization ⋮ Convergence rates of gradient methods for convex optimization in the space of measures ⋮ A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression ⋮ Accelerated variance-reduced methods for saddle-point problems ⋮ Optimal Methods for Convex Risk-Averse Distributed Optimization ⋮ The Frank-Wolfe algorithm: a short introduction ⋮ Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems ⋮ No-regret algorithms in on-line learning, games and convex optimization ⋮ A unified stochastic approximation framework for learning in games ⋮ Runtime Analysis of a Co-Evolutionary Algorithm ⋮ Limitations of neural network training due to numerical instability of backpropagation ⋮ Optimal Algorithms for Stochastic Complementary Composite Minimization ⋮ Conformal mirror descent with logarithmic divergences ⋮ Stochastic incremental mirror descent algorithms with Nesterov smoothing ⋮ Decentralized saddle-point problems with different constants of strong convexity and strong concavity ⋮ Robustifying Markowitz ⋮ Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains ⋮ Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection ⋮ Block mirror stochastic gradient method for stochastic optimization ⋮ Continuous time learning algorithms in optimization and game theory ⋮ Provably efficient reinforcement learning in decentralized general-sum Markov games ⋮ Complexity of optimizing over the integers ⋮ Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ Nonsmooth optimization by Lie bracket approximations into random directions ⋮ Learning Polytopes with Fixed Facet Directions ⋮ Dual gradient method for ill-posed problems using multiple repeated measurement data ⋮ A stochastic non-monotone DR-submodular maximization problem over a convex set ⋮ First-order methods for convex optimization ⋮ Data-Driven Mirror Descent with Input-Convex Neural Networks ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Robust supervised learning with coordinate gradient descent ⋮ Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization ⋮ Entropic Trust Region for Densest Crystallographic Symmetry Group Packings ⋮ Robust high-dimensional tuning free multiple testing ⋮ Lagrangian and Hamiltonian dynamics for probabilities on the statistical bundle ⋮ Detecting identification failure in moment condition models ⋮ Mean estimation in high dimension ⋮ Learning lyapunov functions for hybrid systems ⋮ A Bregman–Kaczmarz method for nonlinear systems of equations ⋮ On the optimal solution of large eigenpair problems ⋮ A survey of information-based complexity ⋮ Riemannian game dynamics ⋮ Marginally parameterized spatio-temporal models and stepwise maximum likelihood estimation ⋮ Stochastic mirror descent dynamics and their convergence in monotone variational inequalities ⋮ A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks ⋮ OSGA: a fast subgradient algorithm with optimal complexity ⋮ A dual method for minimizing a nonsmooth objective over one smooth inequality constraint ⋮ On the ergodic convergence rates of a first-order primal-dual algorithm ⋮ On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients ⋮ Communication complexity of convex optimization ⋮ A weighted mirror descent algorithm for nonsmooth convex optimization problem ⋮ A simplified view of first order methods for optimization ⋮ Sampling from a log-concave distribution with projected Langevin Monte Carlo ⋮ Sparse linear models and \(l_1\)-regularized 2SLS with high-dimensional endogenous regressors and instruments ⋮ On the worst case performance of the steepest descent algorithm for quadratic functions ⋮ Average complexity of divide-and-conquer algorithms ⋮ Optimal search algorithm for a minimum of a discrete periodic bimodal function ⋮ Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint ⋮ Existence and computation of short-run equilibria in economic geography ⋮ A fast dual proximal gradient algorithm for convex minimization and applications ⋮ Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation ⋮ On the information-adaptive variants of the ADMM: an iteration complexity perspective ⋮ Optimal deterministic algorithm generation ⋮ Optimal search algorithm for extrema of a discrete periodic bimodal function ⋮ Stochastic mirror descent method for distributed multi-agent optimization ⋮ Randomization for continuous problems ⋮ Global optimization in clustering using hyperbolic cross points ⋮ Sparse non Gaussian component analysis by semidefinite programming ⋮ On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions ⋮ Accelerated schemes for a class of variational inequalities ⋮ Accelerated training of max-margin Markov networks with kernels ⋮ The CoMirror algorithm for solving nonsmooth constrained convex problems ⋮ Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints ⋮ Discussion on: ``Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints ⋮ Empirical risk minimization for heavy-tailed losses ⋮ First-order methods of smooth convex optimization with inexact oracle ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ Stochastic heavy ball ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Iterative methods of stochastic approximation for solving non-regular nonlinear operator equations ⋮ Descent gradient methods for nonsmooth minimization problems in ill-posed problems ⋮ Scale-free online learning ⋮ Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market ⋮ Distributed constrained optimization via continuous-time mirror design
This page was built for publication:
