Proximal Splitting Methods in Signal Processing

From MaRDI portal
Revision as of 20:35, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2897282


DOI10.1007/978-1-4419-9569-8_10zbMath1242.90160arXiv0912.3522MaRDI QIDQ2897282

Patrick L. Combettes, Jean-Christophe Pesquet

Publication date: 10 July 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.3522

zbMATH Keywords

convex optimization; parallel computing; splitting; frame; denoising; sparsity; proximal algorithm; forward-backward algorithm; Douglas-Rachford algorithm; Landweber method; iterative thresholding; Peaceman-Rachford algorithm; alternating-direction method of multipliers; backward-backward algorithm; restoration and reconstruction


Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C90: Applications of mathematical programming

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory


Related Items

Unnamed Item, Sensitivity Analysis for Mirror-Stratifiable Convex Functions, Low-Rank Inducing Norms with Optimality Interpretations, Optimization Methods for Synthetic Aperture Radar Imaging, A hierarchical Bayesian perspective on majorization-minimization for non-convex sparse regression: application to M/EEG source imaging, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA), Disparity and optical flow partitioning using extended Potts priors, Efficient regularization with wavelet sparsity constraints in photoacoustic tomography, Split common fixed point and null point problems for demicontractive operators in Hilbert spaces, Parameter Selection and Preconditioning for a Graph Form Solver, String-averaging incremental stochastic subgradient algorithms, Total variation superiorized conjugate gradient method for image reconstruction, Proximal extrapolated gradient methods for variational inequalities, Variational regularization of the weighted conical Radon transform, Joint Sparse Recovery Based on Variances, Learning partial differential equations via data discovery and sparse optimization, Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm, Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau, Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems, Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport, A Forward-Adjoint Operator Pair Based on the Elastic Wave Equation for Use in Transcranial Photoacoustic Computed Tomography, Modular proximal optimization for multidimensional total-variation regularization, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, CoShaRP: a convex program for single-shot tomographic shape sensing, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming, Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates, Unnamed Item, A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space, An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction, A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Optimal transport in full-waveform inversion: analysis and practice of the multidimensional Kantorovich–Rubinstein norm, Robust and Scalable Methods for the Dynamic Mode Decomposition, Proximal Gradient Methods with Adaptive Subspace Sampling, Strong convergence theorem for family of minimization and monotone inclusion problems in Hadamard spaces, Proximal Gradient Methods for Machine Learning and Imaging, Combining line search and trust-region methods forℓ1-minimization, The numerical reckoning of modified proximal point methods for minimization problems in non-positive curvature metric spaces, Exploiting low-rank structure in semidefinite programming by approximate operator splitting, Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes, New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems, A Proximal Markov Chain Monte Carlo Method for Bayesian Inference in Imaging Inverse Problems: When Langevin Meets Moreau, Gradient flows and randomised thresholding: sparse inversion and classification*, Convergence rates for the joint solution of inverse problems with compressed sensing data, A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer, A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization, An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces, A splitting method for finding the resolvent of the sum of two maximal monotone operators, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery, NETT: solving inverse problems with deep neural networks, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Proximal Optimization for Fuzzy Subspace Clustering, Relax-and-split method for nonconvex inverse problems, Shrinking approximants for fixed point problem and generalized split null point problem in Hilbert spaces, An iterative method based on ADMM for solving generalized Sylvester matrix equations, Enforcing geometrical priors in deep networks for semantic segmentation applied to radiotherapy planning, A generalized forward-backward splitting operator: degenerate analysis and applications, A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula, An abstract convergence framework with application to inertial inexact forward-backward methods, Bregman three-operator splitting methods, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Optimal Kullback–Leibler approximation of Markov chains via nuclear norm regularisation, Low Complexity Regularization of Linear Inverse Problems, Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization, A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy, Solving the split equality problem without prior knowledge of operator norms, Projection onto a Polyhedron that Exploits Sparsity, A Variable Metric Forward-Backward Method with Extrapolation, A sequential updating scheme of the Lagrange multiplier for separable convex programming, On the convergence of the forward–backward splitting method with linesearches, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, An alternating direction method for total variation denoising, Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme, Sparse time-frequency decomposition based on dictionary adaptation, A nonconvex approach to low-rank matrix completion using convex optimization, A survey on operator splitting and decomposition of convex programs, Discrete Total Variation: New Definition and Minimization, Nonsmooth convex optimization for structured illumination microscopy image reconstruction, Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares, Multiresolution Parameter Choice Method for Total Variation Regularized Tomography, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, Compressive Imaging and Characterization of Sparse Light Deflection Maps, Unnamed Item, Unnamed Item, On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions, A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Projection methods: an annotated bibliography of books and reviews, On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations, A Convex Approach for Image Restoration with Exact Poisson--Gaussian Likelihood, Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA, Quantization and Compressive Sensing, Modified ADMM algorithm for solving proximal bound formulation of multi-delay optimal control problem with bounded control, Sparse Principal Component Analysis via Variable Projection, 4D-CT reconstruction with unified spatial-temporal patch-based regularization, Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings, Iterative algorithm for the split equality problem in Hilbert spaces, Fundamentals of cone regression, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, On some steplength approaches for proximal algorithms, Conic optimization via operator splitting and homogeneous self-dual embedding, Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces, A dual method for minimizing a nonsmooth objective over one smooth inequality constraint, Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings, Proximal point algorithms for nonsmooth convex optimization with fixed point constraints, Sharp MSE bounds for proximal denoising, Low rank matrix recovery from rank one measurements, Nonlinear multilayered representation of graph-signals, Distance majorization and its applications, Compressive optical deflectometric tomography: a constrained total-variation minimization approach, Operator-valued kernel-based vector autoregressive models for network inference, On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm, The modified proximal point algorithm in CAT(0) spaces, Computing the generalized eigenvalues of weakly symmetric tensors, Decomposition methods for a spatial model for long-term energy pricing problem, Adaptive smoothing algorithms for nonsmooth composite convex minimization, Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization, Proximity for sums of composite functions, Randomization of data acquisition and \(\ell_{1}\)-optimization (recognition with compression), A hybrid proximal point algorithm for finding minimizers and fixed points in CAT(0) spaces, A convergent relaxation of the Douglas-Rachford algorithm, Modified proximal point algorithms for solving constrained minimization and fixed point problems in complete CAT(0) spaces, A block coordinate variable metric forward-backward algorithm, A tensor-based dictionary learning approach to tomographic image reconstruction, Generalized row-action methods for tomographic imaging, Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization, An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints, Nonsmoothness in machine learning: specific structure, proximal identification, and applications, A self-adaptive algorithm for split null point problems and fixed point problems for demicontractive multivalued mappings, An adapted linear discriminant analysis with variable selection for the classification in high-dimension, and an application to medical data, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Vertex-frequency analysis on graphs, Proximal point algorithms for finding common fixed points of a finite family of quasi-nonexpansive multi-valued mappings in real Hilbert spaces, Stability analysis of rough surfaces in adhesive normal contact, A convergent least-squares regularized blind deconvolution approach, Accelerating \(\ell^1\)-\(\ell^2\) deblurring using wavelet expansions of operators, Monotone operator theory in convex optimization, Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription, Alternating direction method of multipliers for separable convex optimization of real functions in complex variables, A fast dual proximal gradient algorithm for convex minimization and applications, A regularized semi-smooth Newton method with projection steps for composite convex programs, Adaptive restart of the optimized gradient method for convex optimization, Exact worst-case convergence rates of the proximal gradient method for composite convex minimization, Convergence of functions and their Moreau envelopes on Hadamard spaces, From error bounds to the complexity of first-order descent methods for convex functions, Generalized Kalman smoothing: modeling and algorithms, A conjugate subgradient algorithm with adaptive preconditioning for the least absolute shrinkage and selection operator minimization, Tight global linear convergence rate bounds for Douglas-Rachford splitting, Optimal subgradient algorithms for large-scale convex optimization in simple domains, On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds, A unified formulation for generalized oilfield development optimization, Iterative regularization via dual diagonal descent, The Shannon total variation, Accelerated alternating descent methods for Dykstra-like problems, Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests, An interpolating distance between optimal transport and Fisher-Rao metrics, Extragradient method in optimization: convergence and complexity, A generalized robust minimization framework for low-rank matrix recovery, Sensitivity analysis of the proximal-based parallel decomposition methods, Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization, A cyclic block coordinate descent method with generalized gradient projections, On the zero point problem of monotone operators in Hadamard spaces, A proximal difference-of-convex algorithm with extrapolation, Iterative methods for solving proximal split minimization problems, Split null point problems and fixed point problems for demicontractive multivalued mappings, Iterative algorithms for total variation-like reconstructions in seismic tomography, Proximal algorithms in statistics and machine learning, A block coordinate variable metric linesearch based proximal gradient method, Modified Fejér sequences and applications, A spatial regularization approach for vector quantization, Fast projections onto mixed-norm balls with applications, An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography, A splitting algorithm for dual monotone inclusions involving cocoercive operators, A convex optimization model and algorithm for retinex, Total variation with overlapping group sparsity for deblurring images under Cauchy noise, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Convergence of stochastic proximal gradient algorithm, The distance between convex sets with Minkowski sum structure: application to collision detection, A parallel operator splitting algorithm for solving constrained total-variation retinex, Single-forward-step projective splitting: exploiting cocoercivity, On the linear convergence of forward-backward splitting method. I: Convergence analysis, Strongly convex optimization for joint fractal feature estimation and texture segmentation, Fast Mumford-Shah two-phase image segmentation using proximal splitting scheme, Graphical-model based high dimensional generalized linear models, An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems, Forward-backward-half forward dynamical systems for monotone inclusion problems with application to v-GNE, Tensor theta norms and low rank recovery, Automated data-driven selection of the hyperparameters for total-variation-based texture segmentation, Sparse group fused Lasso for model segmentation: a hybrid approach, A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application, Synthesis of recurrent neural dynamics for monotone inclusion with application to Bayesian inference, Sequential convergence of AdaGrad algorithm for smooth convex optimization, Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport, A survey on compressed sensing approach to systems and control, -Penalized Pairwise Difference Estimation for a High-Dimensional Censored Regression Model, Improving reinforcement learning algorithms: Towards optimal learning rate policies, Recent Theoretical Advances in Non-Convex Optimization, Unnamed Item, Unnamed Item, Unnamed Item, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, Modified proximal point algorithms involving convex combination technique for solving minimization problems with convergence analysis, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples, Higher-order total variation approaches and generalisations, Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and Experiments, Geometric Matrix Midranges, Data-Driven Nonsmooth Optimization, Dynamical Systems Coupled with Monotone Set-Valued Operators: Formalisms, Applications, Well-Posedness, and Stability, A Single-Phase, Proximal Path-Following Framework, Deep unfolding of a proximal interior point method for image restoration, Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition, An image reconstruction model regularized by edge-preserving diffusion and smoothing for limited-angle computed tomography, Plug-and-Play Unplugged: Optimization-Free Reconstruction Using Consensus Equilibrium, Enhancing Compressed Sensing 4D Photoacoustic Tomography by Simultaneous Motion Estimation, Solving inverse problems using data-driven models, Convergence Rates for Projective Splitting, On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence, Adaptive FISTA for Nonconvex Optimization, Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization, A Convex Approach to Superresolution and Regularization of Lines in Images, A Proximal Operator for Multispectral Phase Retrieval Problems, A proximal point method for the sum of maximal monotone operators, Maximum-a-Posteriori Estimation with Bayesian Confidence Regions, ADMM in Krylov Subspace and Its Application to Total Variation Restoration of Spatially Variant Blur, A Selective Linearization Method For Multiblock Convex Optimization, Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing, Data Assimilation in Reduced Modeling, Discrete Wavelet Transforms in the Large Time-Frequency Analysis Toolbox for MATLAB/GNU Octave, Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization, Structured Variable Selection for Regularized Generalized Canonical Correlation Analysis, On a decomposition formula for the proximal operator of the sum of two convex functions, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, Iterative algorithms for a non-linear inverse problem in atmospheric lidar, Sparsity-Assisted Signal Smoothing, Two stochastic optimization algorithms for convex optimization with fixed point constraints, A Fast Algorithm for Learning Overcomplete Dictionary for Sparse Representation Based on Proximal Operators, Discussion on the Paper by Byrne and Girolami, Proximal Distance Algorithms: Theory and Examples, Variable metric forward–backward splitting with applications to monotone inclusions in duality, Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping, Kalman-Based Stochastic Gradient Method with Stop Condition and Insensitivity to Conditioning, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT), An introduction to continuous optimization for imaging, Bayesian computation: a summary of the current state, and samples backwards and forwards, A distributed Douglas-Rachford splitting method for multi-block convex minimization problems, Structured sparsity through convex optimization, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, Learning Maximally Monotone Operators for Image Recovery, Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization, Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems, Signal Decomposition Using Masked Proximal Operators, Implicit regularization with strongly convex bias: Stability and acceleration, A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates, Unnamed Item, On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis, A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems, An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization, Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions, Multiscale hierarchical decomposition methods for ill-posed problems, Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions, Circuit analysis using monotone+skew splitting, Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces, Double inertial proximal gradient algorithms for convex optimization problems and applications, Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials, An accelerated tensorial double proximal gradient method for total variation regularization problem, Constrained composite optimization and augmented Lagrangian methods, Convex regularization in statistical inverse learning problems, Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization, A Review of Data‐Driven Discovery for Dynamic Systems, A physically admissible Stokes vector reconstruction in linear polarimetric imaging, Convergence analysis of modified inertial forward–backward splitting scheme with applications, N-mode minimal tensor extrapolation methods, Structured model selection via ℓ1−ℓ2 optimization, Inexact proximal DC Newton-type method for nonconvex composite functions, Stochastic projective splitting, On maximum a posteriori estimation with Plug \& Play priors and stochastic gradient descent, Sparse Bayesian learning approach for discrete signal reconstruction, A line search based proximal stochastic gradient algorithm with dynamical variance reduction, Data driven discovery of systems of ordinary differential equations using nonconvex multitask learning, A local MM subspace method for solving constrained variational problems in image recovery, Principled analyses and design of first-order methods with inexact proximal operators, Resolvent splitting for sums of monotone operators with minimal lifting, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, Efficient Bayesian Computation for Low-Photon Imaging Problems, First-order methods for convex optimization, On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance, Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization, Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch, Optimal Transport Approximation of 2-Dimensional Measures, Fast selection of nonlinear mixed effect models using penalized likelihood, Convergence analysis for variational inequalities and fixed point problems in reflexive Banach spaces, A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings, Random activations in primal-dual splittings for monotone inclusions with a priori information, Efficient proximal mapping computation for low-rank inducing norms, Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems, Proximal nested sampling for high-dimensional Bayesian model selection, Convergence analysis of the stochastic reflected forward-backward splitting algorithm, High-performance statistical computing in the computing environments of the 2020s, A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform, An adaptive alternating direction method of multipliers, Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets, A unified Douglas-Rachford algorithm for generalized DC programming, Projective splitting with forward steps, Peridynamics enabled learning partial differential equations, Speckle reduction in matrix-log domain for synthetic aperture radar imaging, Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting), An adaptive splitting algorithm for the sum of two generalized monotone operators and one cocoercive operator, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces, On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations, Convergence analysis of the shrinking approximants for fixed point problem and generalized split common null point problem, Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC, Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting, A parallel hybrid accelerated extragradient algorithm for pseudomonotone equilibrium, fixed point, and split null point problems, Inexact first-order primal-dual algorithms, An extragradient algorithm for solving equilibrium problem and zero point problem in Hadamard spaces, Alternating forward-backward splitting for linearly constrained optimization problems, The multiproximal linearization method for convex composite problems, Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting, Contrast invariant SNR and isotonic regressions, Group sparse recovery in impulsive noise via alternating direction method of multipliers, Non-convex total variation regularization for convex denoising of signals, Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data, A proximal interior point algorithm with applications to image processing, Correcting the side effects of ADC filtering in MR image reconstruction, Estimation of Monge matrices, Recovery guarantees for polynomial coefficients from weakly dependent data with outliers, Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization, An adaptive primal-dual framework for nonsmooth convex minimization, Variable metric techniques for forward-backward methods in imaging, Convolutional proximal neural networks and plug-and-play algorithms, Robust regression with compositional covariates, Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces, A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation, Homogeneous penalizers and constraints in convex image restoration, An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices, Fully smoothed \(\ell_1\)-\(TV\) models: bounds for the minimizers and parameter choice, Learning with tensors: a framework based on convex optimization and spectral regularization, Data-driven time-frequency analysis, Infeasibility detection in the alternating direction method of multipliers for convex optimization, A hybrid extragradient method for a general split equality problem involving resolvents and pseudomonotone bifunctions in Banach spaces, Fast robust methods for singular state-space models, Douglas-Rachford splitting and ADMM for pathological convex optimization, On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting, An adaptive fixed-point proximity algorithm for solving total variation denoising models, Accelerated proximal incremental algorithm schemes for non-strongly convex functions, Projective splitting with forward steps only requires continuity, On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind, Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization, A new generalized projection and its application to acceleration of audio declipping, The modified second APG method for DC optimization problems, Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints, The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints, Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms, Multiview attenuation estimation and correction, Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging, Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions, Truncated sparse approximation property and truncated \(q\)-norm minimization, Designing Gabor windows using convex optimization, An iterative method for solving proximal split feasibility problems and fixed point problems, An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming, A proximal framework for fuzzy subspace clustering, Convergence analysis of an inexact three-operator splitting algorithm, Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces, Backward-backward splitting in Hadamard spaces, A splitting algorithm for coupled system of primal-dual monotone inclusions, Proximal operator of quotient functions with application to a feasibility problem in query optimization, Combined first and second order variational approaches for image processing, On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, Proximal point algorithms for a hybrid pair of nonexpansive single-valued and multi-valued mappings in geodesic metric spaces, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Localized density matrix minimization and linear-scaling algorithms, Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators, Depression disorder classification of fMRI data using sparse low-rank functional brain network and graph-based features, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, Perspective functions: proximal calculus and applications in high-dimensional statistics, Computing proximal points of convex functions with inexact subgradients, RNLp: mixing nonlocal and TV-Lp methods to remove impulse noise from images, Nonconvex mixed TV/Cahn-Hilliard functional for super-resolution/segmentation of 3D trabecular bone images, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems, A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography, An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso, Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization, On proximal gradient method for the convex problems regularized with the group reproducing kernel norm, On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems, Proximal Markov chain Monte Carlo algorithms, Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering, Quadratic growth conditions and uniqueness of optimal solution to Lasso


Uses Software


Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2897282&oldid=15859009"
Powered by MediaWiki