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.
- Nonconvex optimization with inertial proximal stochastic variance reduction gradient (Q6052662) (← links)
- Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications (Q6056241) (← links)
- An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee (Q6057272) (← links)
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems (Q6064055) (← links)
- Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients (Q6071885) (← links)
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions (Q6071886) (← links)
- The convergence properties of infeasible inexact proximal alternating linearized minimization (Q6074854) (← links)
- Fully-connected tensor network decomposition for robust tensor completion problem (Q6087983) (← links)
- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems (Q6099473) (← links)
- A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization (Q6100428) (← links)
- Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support (Q6101122) (← links)
- Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery (Q6101685) (← links)
- A Bayesian-variational cyclic method for solving estimation problems characterized by non-uniqueness (equifinality) (Q6105093) (← links)
- A new Lagrangian-based first-order method for nonconvex constrained optimization (Q6106553) (← links)
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems (Q6106955) (← links)
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds (Q6110426) (← links)
- Joint Reconstruction-Segmentation on Graphs (Q6113269) (← links)
- Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity (Q6113918) (← links)
- A framelet sparse reconstruction method for pansharpening with guaranteed convergence (Q6115635) (← links)
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems (Q6116248) (← links)
- Tensor factorization via transformed tensor-tensor product for image alignment (Q6119848) (← links)
- A generalized non-convex method for robust tensor completion (Q6134430) (← links)
- An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise (Q6135676) (← links)
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
- An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems (Q6138306) (← links)
- Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems (Q6145059) (← links)
- A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)
- Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization (Q6151000) (← links)
- The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor (Q6151002) (← links)
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems (Q6154406) (← links)
- Regularising inverse problems with generative machine learning models (Q6154435) (← links)
- Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems (Q6155872) (← links)
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems (Q6157998) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- A refined inertial DC algorithm for DC programming (Q6159465) (← links)
- A cascading l0 regularization reconstruction method in nonsubsampled contourlet domain for limited-angle CT (Q6160608) (← links)
- An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization (Q6161202) (← links)
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
- A local MM subspace method for solving constrained variational problems in image recovery (Q6162148) (← links)
- Conservative parametric optimality and the ridge method for tame min-max problems (Q6163857) (← links)
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
- Saturation-value based higher-order regularization for color image restoration (Q6164175) (← links)
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant (Q6166106) (← links)
- Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)
- A DCA-Newton method for quartic minimization over the sphere (Q6168057) (← links)
- A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion (Q6168342) (← links)
- Fast optimization via inertial dynamics with closed-loop damping (Q6172672) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
