Inexact and accelerated proximal point algorithms
From MaRDI portal
Publication:4903682
Recommendations
- An accelerated inexact proximal point algorithm for convex minimization
- Accelerated and inexact forward-backward algorithms
- Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
- scientific article; zbMATH DE number 1062747
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
Cited in
(76)- Inexact proximal stochastic gradient method for convex composite optimization
- A block coordinate variable metric linesearch based proximal gradient method
- An accelerated inexact proximal point algorithm for convex minimization
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
- Distributed decision-coupled constrained optimization via proximal-tracking
- On the inexact scaled gradient projection method
- A nested primal-dual FISTA-like scheme for composite convex optimization problems
- Local convergence of tensor methods
- The developments of proximal point algorithms
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
- On finite termination of an inexact proximal point algorithm
- Inexact first-order primal-dual algorithms
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
- On starting and stopping criteria for nested primal-dual iterations
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Convergence analysis of an inexact three-operator splitting algorithm
- Computing proximal points of convex functions with inexact subgradients
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- Self-adaptive inexact proximal point methods
- Inexact proximal point algorithms and descent methods in optimization
- New convergence results for the inexact variable metric forward-backward method
- Inexact accelerated high-order proximal-point methods
- On FISTA with a relative error rule
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Accelerated and inexact forward-backward algorithms
- An inexact successive quadratic approximation method for L-1 regularized optimization
- scientific article; zbMATH DE number 7449564 (Why is no real title available?)
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Proximal methods for the latent group lasso penalty
- Modular proximal optimization for multidimensional total-variation regularization
- Inertial variable metric techniques for the inexact forward-backward algorithm
- Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization
- Nesterov perturbations and projection methods applied to IMRT
- The indefinite proximal point algorithms for maximal monotone operators
- Inexact high-order proximal-point methods with auxiliary search procedure
- Convergence rate of a relaxed inertial proximal algorithm for convex minimization
- Contracting proximal methods for smooth convex optimization
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Alternating proximal regularized dictionary learning
- Accelerated iterative regularization via dual diagonal descent
- Convergence analysis of inexact randomized iterative methods
- Implicit regularization with strongly convex bias: Stability and acceleration
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Accelerated differential inclusion for convex optimization
- An inexact primal-dual method with correction step for a saddle point problem in image debluring
- Principled analyses and design of first-order methods with inexact proximal operators
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity
- Inexact proximal Newton methods in Hilbert spaces
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
- An inexact gradient mirror descent algorithm for non-smooth convex optimization
- Sharper Bounds for Proximal Gradient Algorithms with Errors
- The Inexact Cyclic Block Proximal Gradient Method and Properties of Inexact Proximal Maps
- A new proximal heavy ball inexact line-search algorithm
- Proximal Langevin sampling with inexact proximal mapping
- Extragradient method with feasible inexact projection to variational inequality problem
- A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity
- Convergence analysis of a primal-dual optimization-by-continuation algorithm
- Consistent learning by composite proximal thresholding
- Moreau envelope and proximal-point methods under the lens of high-order regularization
- Outcome-guided spike-and-slab Lasso biclustering: a novel approach for enhancing biclustering techniques for gene expression analysis
- Linesearch-enhanced forward-backward methods for inexact nonconvex scenarios
- First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
- A relative inexact proximal gradient method with an explicit linesearch
- Projective splitting with backward, half-forward and proximal-Newton steps
- Forward-backward algorithms for weakly convex problems
- Minimizing quasi-self-concordant functions by gradient regularization of Newton method
- Inexact golden ratio primal-dual algorithms for structured convex optimization problems
- Inexact proximal point methods in metric spaces
This page was built for publication: Inexact and accelerated proximal point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903682)