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 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)
• Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis (Q6158000) (← 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)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Scaled proximal gradient methods for sparse optimization problems (Q6184263) (← links)
• A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition (Q6189172) (← links)
• Template-based image reconstruction facing different topologies (Q6191359) (← links)
• Analysis of a variable metric block coordinate method under proximal errors (Q6195234) (← links)
• An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost (Q6200957) (← links)
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
• A Path-Based Approach to Constrained Sparse Optimization (Q6202768) (← links)
• (Q6203708) (← links)
• A structure noise-aware tensor dictionary learning method for high-dimensional data clustering (Q6205030) (← links)
• Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere (Q6493976) (← links)
• A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis (Q6497038) (← links)
• SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
• A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
• Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants (Q6540011) (← links)
• Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks (Q6540474) (← links)
• A new proximal heavy ball inexact line-search algorithm (Q6541375) (← links)
• Convergence analysis of block majorize-minimize subspace approach (Q6542454) (← links)
• The gradient projection method for a supporting function on the unit sphere and its applications (Q6552607) (← links)
• A layer potential approach to inverse problems in brain imaging (Q6554754) (← links)
• A stochastic ADMM algorithm for large-scale ptychography with weighted difference of anisotropic and isotropic total variation (Q6557664) (← links)
• On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties (Q6559515) (← links)
• A scalable sphere-constrained magnitude-sparse SAR imaging (Q6561480) (← links)