scientific article; zbMATH DE number 3850830

zbMATH Open0535.90071MaRDI QIDQ3320132FDOQ3320132

Authors: Yuri Nesterov 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent
• A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space
• scientific article; zbMATH DE number 4057292
• scientific article; zbMATH DE number 3847229
• scientific article; zbMATH DE number 2102650

zbMATH Keywords

estimationconvergence rateconstrained minimizationglobal Lipschitz conditiondifferentiable objective functionconvex programming in Hilbert space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Programming in abstract spaces (90C48) Inner product spaces and their generalizations, Hilbert spaces (46C99)

Cited In (only showing first 100 items - show all)

• Numerical computations of split Bregman method for fourth order total variation flow
• Nesterov-aided stochastic gradient methods using Laplace approximation for Bayesian design optimization
• A new class of accelerated regularization methods, with application to bioluminescence tomography
• On dissipative symplectic integration with applications to gradient-based optimization
• Analysis of a heuristic rule for the IRGNM in Banach spaces with convex regularization terms
• Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
• A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
• Title not available (Why is that?)
• Adaptive FISTA for Nonconvex Optimization
• Convergence rate of a relaxed inertial proximal algorithm for convex minimization
• Quantum entropic regularization of matrix-valued optimal transport
• Two New Inertial Algorithms for Solving Variational Inequalities in Reflexive Banach Spaces
• Title not available (Why is that?)
• Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems
• Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization
• Inertial iterative algorithms for common solution of variational inequality and system of variational inequalities problems
• Accelerated information gradient flow
• Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems
• EGC: entropy-based gradient compression for distributed deep learning
• \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
• Variational inequality over the set of common solutions of a system of bilevel variational inequality problem with applications
• Stochastic generalized gradient methods for training nonconvex nonsmooth neural networks
• Determining a time-dependent coefficient in a time-fractional diffusion-wave equation with the Caputo derivative by an additional integral condition
• An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
• An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
• Iteration complexity of generalized complementarity problems
• Learning context-dependent choice functions
• A proximal point like method for solving tensor least-squares problems
• A piecewise conservative method for unconstrained convex optimization
• Understanding the acceleration phenomenon via high-resolution differential equations
• A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems
• Asymptotic for a second order evolution equation with damping and regularizing terms
• Iterative pre-conditioning for expediting the distributed gradient-descent method: the case of linear least-squares problem
• An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
• Two-stage geometric information guided image reconstruction
• Weak and strong convergence of inertial algorithms for solving split common fixed point problems
• The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem
• Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning
• An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
• Scheduled restart momentum for accelerated stochastic gradient descent
• Alternating forward-backward splitting for linearly constrained optimization problems
• An algorithm for the split feasible problem and image restoration
• How does momentum benefit deep neural networks architecture design? A few case studies
• The common-directions method for regularized empirical risk minimization
• Computing ground states of Bose-Einstein condensates with higher order interaction via a regularized density function formulation
• Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping
• Unified acceleration of high-order algorithms under general Hölder continuity
• Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
• Regularized nonlinear acceleration
• An accelerated differential equation system for generalized equations
• Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
• Convergence rates of first- and higher-order dynamics for solving linear ill-posed problems
• SRKCD: a stabilized Runge-Kutta method for stochastic optimization
• An inertial based forward-backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces
• An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
• Adaptive Hamiltonian variational integrators and applications to symplectic accelerated optimization
• Unbiased MLMC stochastic gradient-based optimization of Bayesian experimental designs
• An inertially constructed forward-backward splitting algorithm in Hilbert spaces
• Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
• Bregman Itoh-Abe methods for sparse optimisation
• Constructing unbiased gradient estimators with finite variance for conditional stochastic optimization
• Domain adaptation and sample bias correction theory and algorithm for regression
• On the proximal gradient algorithm with alternated inertia
• A reweighted \(\ell^2\) method for image restoration with Poisson and mixed Poisson-Gaussian noise
• ASD+M: automatic parameter tuning in stochastic optimization and on-line learning
• Optimal subgradient methods: computational properties for large-scale linear inverse problems
• Augmented Lagrangian algorithms for linear programming
• Sparse PCA: convex relaxations, algorithms and applications
• Linear coupling: an ultimate unification of gradient and mirror descent
• Comparative study of RPSALG algorithm for convex semi-infinite programming
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• An efficient primal-dual method for the obstacle problem
• A review of nonlinear FFT-based computational homogenization methods
• Reference and command governors for systems with constraints: A survey on theory and applications
• Dual subgradient algorithms for large-scale nonsmooth learning problems
• Proximal algorithms in statistics and machine learning
• Projected subgradient minimization versus superiorization
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• Operator splittings, Bregman methods and frame shrinkage in image processing
• A differential variational approach for handling fluid-solid interaction problems via smoothed particle hydrodynamics
• Certification aspects of the fast gradient method for solving the dual of parametric convex programs
• Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
• Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
• First-order methods for convex optimization
• Adaptive restart for accelerated gradient schemes
• Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\)
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Proximal splitting methods in signal processing
• A convergent least-squares regularized blind deconvolution approach
• Sparse regression with multi-type regularized feature modeling
• Diffusion tensor imaging with deterministic error bounds
• Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models
• Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
• Accelerated gradient boosting
• Image restoration with mixed or unknown noises
• Exact worst-case performance of first-order methods for composite convex optimization
• Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
• Backtracking strategies for accelerated descent methods with smooth composite objectives
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
• A linear-time algorithm for trust region problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320132)