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)- Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Convergence of the augmented decomposition algorithm
- A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
- Large-scale eigenvector approximation via Hilbert space embedding Nyström
- First-order optimization algorithms via inertial systems with Hessian driven damping
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- Stochastic heavy ball
- Stochastic accelerated alternating direction method of multipliers with importance sampling
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- On the convergence of a class of inertial dynamical systems with Tikhonov regularization
- Convergence rates of inertial forward-backward algorithms
- Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- Accelerated stochastic variance reduction for a class of convex optimization problems
- Alternating direction based method for optimal control problem constrained by Stokes equation
- Accelerated differential inclusion for convex optimization
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
- Damped inertial dynamics with vanishing Tikhonov regularization: strong asymptotic convergence towards the minimum norm solution
- Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping
- MAGMA: multilevel accelerated gradient mirror descent algorithm for large-scale convex composite minimization
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Convergence rates of the heavy ball method for quasi-strongly convex optimization
- A projected extrapolated gradient method with larger step size for monotone variational inequalities
- A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Mixed higher order variational model for image recovery
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization
- Convergence of damped inertial dynamics governed by regularized maximally monotone operators
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- A cyclic projected gradient method
- Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient
- A fast image recovery algorithm based on splitting deblurring and denoising
- Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion
- Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis
- Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases
- A proximal difference-of-convex algorithm with extrapolation
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- A duality based approach to the minimizing total variation flow in the space \(H^{-s}\)
- On variance reduction for stochastic smooth convex optimization with multiplicative noise
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
- Iterative algorithms for total variation-like reconstructions in seismic tomography
- A new fast algorithm for constrained four-directional total variation image denoising problem
- Optimizing cluster structures with inner product induced norm based dissimilarity measures: theoretical development and convergence analysis
- On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping
- scientific article; zbMATH DE number 7306890 (Why is no real title available?)
- Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
- On the reconstruction of media inhomogeneity by inverse wave scattering model
- The Shannon total variation
- Multiple change points detection in high-dimensional multivariate regression
- A stochastic gradient algorithm with momentum terms for optimal control problems governed by a convection-diffusion equation with random diffusivity
- Second-order stochastic optimization for machine learning in linear time
- Finding the nearest positive-real system
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Accelerated gradient boosting
- Robust least square semidefinite programming with applications
- Performance of first-order methods for smooth convex minimization: a novel approach
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Random algorithms for convex minimization problems
- Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Domain adaptation and sample bias correction theory and algorithm for regression
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Efficient valuation of SCR via a neural network approach
- A convergent least-squares regularized blind deconvolution approach
- A differential variational approach for handling fluid-solid interaction problems via smoothed particle hydrodynamics
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Clustering and feature selection using sparse principal component analysis
- Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
- Image restoration with mixed or unknown noises
- On the second-order asymptotical regularization of linear ill-posed inverse problems
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- Exact worst-case performance of first-order methods for composite convex optimization
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Projected subgradient minimization versus superiorization
- On the proximal gradient algorithm with alternated inertia
- Augmented Lagrangian algorithms for linear programming
- Sparse PCA: convex relaxations, algorithms and applications
- An efficient primal-dual method for the obstacle problem
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Phase recovery, MaxCut and complex semidefinite programming
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- An Accelerated Level-Set Method for Inverse Scattering Problems
- Proximal splitting methods in signal processing
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
- Minimax and Minimax Projection Designs Using Clustering
- A review of nonlinear FFT-based computational homogenization methods
- Accelerated, parallel, and proximal coordinate descent
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)
