Pages that link to "Item:Q5740077"

The following pages link to An introduction to continuous optimization for imaging (Q5740077):

Displaying 50 items.

• Modern regularization methods for inverse problems (Q5230515) (← links)
• Solving inverse problems using data-driven models (Q5230520) (← links)
• Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives (Q5231684) (← links)
• Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size (Q5232280) (← links)
• Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization (Q5236633) (← links)
• Regularization of inverse problems via time discrete geodesics in image spaces (Q5383306) (← links)
• Learning Consistent Discretizations of the Total Variation (Q5860342) (← links)
• Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
• Variational Densification and Refinement of Registration Maps (Q5860345) (← links)
• Improved Recovery Guarantees and Sampling Strategies for TV Minimization in Compressive Imaging (Q5860357) (← links)
• Shared Prior Learning of Energy-Based Models for Image Reconstruction (Q5860383) (← links)
• A primal-dual flow for affine constrained convex optimization (Q5864593) (← links)
• An Efficient Variational Model for Multiplicative Noise Removal (Q5864771) (← links)
• New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model (Q5864782) (← links)
• Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems (Q5865360) (← links)
• Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization (Q5869821) (← links)
• Bilevel Methods for Image Reconstruction (Q5870782) (← links)
• A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates (Q5882231) (← links)
• A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming (Q5886869) (← links)
• Optimal transportation, modelling and numerical simulation (Q5887829) (← links)
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) (← links)
• An inexact primal-dual method with correction step for a saddle point problem in image debluring (Q6064056) (← links)
• Sliced optimal transport on the sphere (Q6070746) (← links)
• On a variational problem with a nonstandard growth functional and its applications to image processing (Q6098356) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• FISTA is an automatic geometrically optimized algorithm for strongly convex functions (Q6120847) (← links)
• The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution (Q6144058) (← links)
• Learning Regularization Parameter-Maps for Variational Image Reconstruction Using Deep Neural Networks and Algorithm Unrolling (Q6144067) (← links)
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)
• First order inertial optimization algorithms with threshold effects associated with dry friction (Q6146366) (← links)
• Enhanced total variation minimization for stable image reconstruction (Q6162738) (← links)
• Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
• Efficient Bayesian Computation for Low-Photon Imaging Problems (Q6168337) (← links)
• A Class of Priors for Color Image Restoration Parameterized by Lie Groups Acting on Pixel Values (Q6168338) (← links)
• On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance (Q6170448) (← links)
• A Flexible Space-Variant Anisotropic Regularization for Image Restoration with Automated Parameter Selection (Q6176000) (← links)
• Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing (Q6176003) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
• On inertial iterated Tikhonov methods for solving ill-posed problems (Q6194965) (← links)
• Utility/privacy trade-off as regularized optimal transport (Q6201932) (← links)
• Efficient Convex Optimization for Non-convex Non-smooth Image Restoration (Q6495865) (← links)
• An FFT-based method for computing weighted minimal surfaces in microstructures with applications to the computational homogenization of brittle fracture (Q6497723) (← links)
• Generalized proximal point algorithms with correction terms and extrapolation (Q6536963) (← links)
• A simple and efficient convex optimization based bound-preserving high order accurate limiter for Cahn-Hilliard-Navier-Stokes system (Q6551217) (← links)
• A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid (Q6554004) (← links)
• A dual-primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems (Q6554015) (← links)
• Lippmann-Schwinger solvers for the computational homogenization of materials with pores (Q6554333) (← links)
• Linear convergence of forward-backward accelerated algorithms without knowledge of the modulus of strong convexity (Q6561383) (← links)
• Complexity analysis based on tuning the viscosity parameter of the Su-Boyd-Candès inertial gradient dynamics (Q6564760) (← links)