Pages that link to "Item:Q403666"

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

Displaying 50 items.

• An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising (Q5860376) (← links)
• Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise (Q5863519) (← links)
• Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms (Q5863527) (← links)
• An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory (Q5864689) (← links)
• Embedding of a homothete in a convex compactum: an algorithm and its convergence (Q5867592) (← links)
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs (Q5868963) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property (Q5870355) (← links)
• Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms (Q5881399) (← links)
• Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^* (Q5885760) (← links)
• An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise (Q5887849) (← links)
• On Algorithms for Difference of Monotone Operators (Q5896074) (← links)
• On Algorithms for Difference of Monotone Operators (Q5896140) (← links)
• Solving sparse principal component analysis with global support (Q6038649) (← links)
• Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations (Q6038672) (← links)
• Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation (Q6038829) (← links)
• A converged deep graph semi-NMF algorithm for learning data representation (Q6042581) (← links)
• On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization (Q6042933) (← links)
• New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
• An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
• Robust sensing of low-rank matrices with non-orthogonal sparse decomposition (Q6051152) (← links)
• Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
• Global convergence of the gradient method for functions definable in o-minimal structures (Q6052062) (← links)
• 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)
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity (Q6078423) (← links)
• A branch and bound method solving the max–min linear discriminant analysis problem (Q6078428) (← 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)
• The landscape of the proximal point method for nonconvex-nonconcave minimax optimization (Q6110439) (← 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)