Pages that link to "Item:Q403666"

The following pages link to Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666):

Displaying 50 items.

• Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection (Q2245027) (← links)
• Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
• Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems (Q2275326) (← links)
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
• Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame (Q2297111) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
• Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
• A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction (Q2307219) (← links)
• An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors (Q2307705) (← links)
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems (Q2307755) (← links)
• The modified second APG method for DC optimization problems (Q2311112) (← links)
• A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization (Q2311987) (← links)
• The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (Q2315259) (← links)
• Using Landweber iteration to quantify source conditions -- a numerical study (Q2316689) (← links)
• Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging (Q2320461) (← links)
• Block-proximal methods with spatially adapted acceleration (Q2323015) (← links)
• Optimization problems involving group sparsity terms (Q2330642) (← links)
• A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
• CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging (Q2360837) (← links)
• Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
• Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
• Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method (Q2399164) (← links)
• Alternating proximal gradient method for convex minimization (Q2399191) (← links)
• Inertial proximal alternating minimization for nonconvex and nonsmooth problems (Q2406278) (← links)
• Wavelet tight frame and prior image-based image reconstruction from limited-angle projection data (Q2408413) (← links)
• Backward-forward algorithms for structured monotone inclusions in Hilbert spaces (Q2408627) (← links)
• Convex optimization approach to signals with fast varying instantaneous frequency (Q2409037) (← links)
• An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem (Q2412836) (← links)
• Alternating direction method of multipliers for nonconvex fused regression problems (Q2416739) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation (Q2419549) (← links)
• A nonconvex model with minimax concave penalty for image restoration (Q2420696) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional (Q2422864) (← links)
• First-order methods almost always avoid strict saddle points (Q2425175) (← links)
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
• Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
• Robust low transformed multi-rank tensor methods for image alignment (Q2660687) (← links)
• Convergence and stability analysis of the half thresholding based few-view CT reconstruction (Q2660793) (← links)
• New convergence results for the inexact variable metric forward-backward method (Q2662557) (← links)
• A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function (Q2662659) (← links)
• An approximation method of CP rank for third-order tensor completion (Q2662903) (← links)
• Proximal gradient methods for general smooth graph total variation model in unsupervised learning (Q2674267) (← links)
• Proximal linearization methods for Schatten \(p\)-quasi-norm minimization (Q2678970) (← links)
• A generalized forward-backward splitting operator: degenerate analysis and applications (Q2685263) (← links)
• An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)