A fast dual proximal gradient algorithm for convex minimization and applications
From MaRDI portal
Recommendations
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
- On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
- A fast dual gradient method for separable convex optimization via smoothing
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An algorithm for total variation minimization and applications
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dualization of signal recovery problems
- Efficient schemes for total variation minimization under constraints in image processing
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Monotone Operators and the Proximal Point Algorithm
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- Proximal splitting methods in signal processing
- Proximité et dualité dans un espace hilbertien
- Total Variation Projection With First Order Schemes
- Variational Analysis
Cited in
(41)- An alternating semiproximal method for nonconvex regularized structured total least squares problems
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Dual gradient method for ill-posed problems using multiple repeated measurement data
- On the complexity analysis of the primal solutions for the accelerated randomized dual coordinate ascent
- Decomposition methods for sparse matrix nearness problems
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- Minimization of strictly convex functions: an improved optimality test based on Fenchel duality
- On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Proximal Gradient Methods for Machine Learning and Imaging
- The Douglas-Rachford algorithm in the affine-convex case
- Implicit regularization with strongly convex bias: Stability and acceleration
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Accelerated iterative regularization via dual diagonal descent
- Deautoconvolution in the two-dimensional case
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\)
- Fast proximity-gradient algorithms for structured convex optimization problems
- Accelerated dual-averaging primal–dual method for composite convex minimization
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- A dual approach for optimal algorithms in distributed optimization over networks
- Convergence rates of proximal gradient methods via the convex conjugate
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Dual space preconditioning for gradient descent
- A general double-proximal gradient algorithm for d.c. programming
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
- The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
- Proximal algorithms in statistics and machine learning
- Linearly-convergent FISTA variant for composite optimization with duality
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems
- Finding best approximation pairs for two intersections of closed convex sets
- Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
- Acceleration of the PDHGM on partially strongly convex functions
- Stochastic proximal linear method for structured non-convex problems
- A fast dual gradient method for separable convex optimization via smoothing
- Dual fast projected gradient method for quadratic programming
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
This page was built for publication: A fast dual proximal gradient algorithm for convex minimization and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667162)
