Pages that link to "Item:Q403666"
From MaRDI portal
The following pages link to Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666):
Displaying 50 items.
- Non-convex clustering via proximal alternating linearized minimization method (Q4634919) (← links)
- Blind image fusion for hyperspectral imaging with the directional total variation (Q4638170) (← links)
- On the convergence of higher-order orthogonal iteration (Q4685516) (← links)
- Variational Phase Retrieval with Globally Convergent Preconditioned Proximal Algorithm (Q4686910) (← links)
- Coherence Retrieval Using Trace Regularization (Q4686932) (← links)
- Interactive Video Colorization Within a Variational Framework (Q4689665) (← links)
- PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization (Q4689757) (← links)
- Blind Source Separation with Outliers in Transformed Domains (Q4689770) (← links)
- On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm (Q4689776) (← links)
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
- On $\ell_p$-Support Vector Machines and Multidimensional Kernels (Q4969046) (← links)
- Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction (Q4973544) (← links)
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints (Q4976346) (← links)
- Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions (Q4985183) (← links)
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
- Overlapping Domain Decomposition Methods for Ptychographic Imaging (Q4997367) (← links)
- Incremental CP Tensor Decomposition by Alternating Minimization Method (Q4997836) (← links)
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms (Q5000580) (← links)
- A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization (Q5002572) (← links)
- A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization (Q5005209) (← links)
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
- Continuous-domain assignment flows (Q5014843) (← links)
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model <sup>*</sup> (Q5019920) (← links)
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization (Q5024392) (← links)
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons (Q5025784) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
- Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods (Q5038173) (← links)
- A Spatial Color Compensation Model Using Saturation-Value Total Variation (Q5043737) (← links)
- A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm (Q5043740) (← links)
- ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography (Q5044977) (← links)
- A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization (Q5057774) (← links)
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition (Q5058656) (← links)
- A semi-alternating algorithm for solving nonconvex split equality problems (Q5067633) (← links)
- A new nonlocal low-rank regularization method with applications to magnetic resonance image denoising (Q5076011) (← links)
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes (Q5077167) (← links)
- Data-Driven Tight Frame Construction for Impulsive Noise Removal (Q5079544) (← links)
- A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
- Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation (Q5081098) (← links)
- A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions (Q5099775) (← links)
- Trimmed Statistical Estimation via Variance Reduction (Q5108267) (← links)
- Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints (Q5108481) (← links)
- Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems (Q5109274) (← links)
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set (Q5110557) (← links)
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates (Q5119852) (← links)
- Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
- Nonnegative Matrix Factorization Via Archetypal Analysis (Q5130630) (← links)
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope (Q5131965) (← links)
