scientific article; zbMATH DE number 3850830
From MaRDI portal
Publication:3320132
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
Cited in
(only showing first 100 items - show all)- Constructing unbiased gradient estimators with finite variance for conditional stochastic optimization
- Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping
- 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
- Analysis of a heuristic rule for the IRGNM in Banach spaces with convex regularization terms
- Unified acceleration of high-order algorithms under general Hölder continuity
- Numerical computations of split Bregman method for fourth order total variation flow
- Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
- A proximal regularized Gauss-Newton-Kaczmarz method and its acceleration for nonlinear ill-posed problems
- Regularized nonlinear acceleration
- An accelerated forward-backward algorithm with a new linesearch for convex minimization problems and its applications
- Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
- 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
- scientific article; zbMATH DE number 7370590 (Why is no real title available?)
- Bregman Itoh-Abe methods for sparse optimisation
- 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
- How does momentum benefit deep neural networks architecture design? A few case studies
- Asymptotic for a second order evolution equation with damping and regularizing terms
- Scheduled restart momentum for accelerated stochastic gradient descent
- Quantum entropic regularization of matrix-valued optimal transport
- Convergence rate of a relaxed inertial proximal algorithm for convex minimization
- A new class of accelerated regularization methods, with application to bioluminescence tomography
- Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems
- An inertial based forward-backward algorithm for monotone inclusion problems and split mixed equilibrium problems in Hilbert spaces
- Adaptive FISTA for Nonconvex Optimization
- Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
- 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
- Alternating forward-backward splitting for linearly constrained optimization problems
- Two New Inertial Algorithms for Solving Variational Inequalities in Reflexive Banach Spaces
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
- A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
- Iteration complexity of generalized complementarity problems
- Learning context-dependent choice functions
- Adaptive Hamiltonian variational integrators and applications to symplectic accelerated optimization
- A proximal point like method for solving tensor least-squares problems
- A piecewise conservative method for unconstrained convex optimization
- On dissipative symplectic integration with applications to gradient-based optimization
- Unbiased MLMC stochastic gradient-based optimization of Bayesian experimental designs
- The common-directions method for regularized empirical risk minimization
- Nesterov-aided stochastic gradient methods using Laplace approximation for Bayesian design optimization
- Computing ground states of Bose-Einstein condensates with higher order interaction via a regularized density function formulation
- An inertially constructed forward-backward splitting algorithm in Hilbert spaces
- An algorithm for the split feasible problem and image restoration
- Understanding the acceleration phenomenon via high-resolution differential equations
- scientific article; zbMATH DE number 7370630 (Why is no real title available?)
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- Inexact Newton regularization combined with two-point gradient methods for nonlinear ill-posed problems
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- The approximate duality gap technique: a unified theory of first-order methods
- Is there an analog of Nesterov acceleration for gradient-based MCMC?
- A stochastic subspace approach to gradient-free optimization in high dimensions
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences
- A hadamard-stable extension of courant's sequential method for convex extremal problems
- Variational image regularization with Euler's elastica using a discrete gradient scheme
- Efficient multiplicative noise removal method using isotropic second order total variation
- Complexity of gradient descent for multiobjective optimization
- GMRES-accelerated ADMM for quadratic objectives
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Proximal Gradient Methods for Machine Learning and Imaging
- An extension of the second order dynamical system that models Nesterov's convex gradient method
- Nonconvex robust programming via value-function optimization
- An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
- A second-order adaptive Douglas-Rachford dynamic method for maximal \(\alpha\)-monotone operators
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- Preconditioned accelerated gradient descent methods for locally Lipschitz smooth objectives with applications to the solution of nonlinear PDEs
- PDE acceleration: a convergence rate analysis and applications to obstacle problems
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- An inertial extrapolation method for solving generalized split feasibility problems in real Hilbert spaces
- Gradient descent finds the cubic-regularized nonconvex Newton step
- A fast two-point gradient method for solving non-smooth nonlinear ill-posed problems
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- Sharpness, restart, and acceleration
- Tikhonov regularization of a second order dynamical system with Hessian driven damping
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- Multicomposite nonconvex optimization for training deep neural networks
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Potential reduction method for harmonically convex programming
- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator
- Sublinear-time quadratic minimization via spectral decomposition of matrices
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)
