Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization (Q827076): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-019-00864-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-019-00864-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3010081100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and applications for approximate nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity-enforcing regularisation and ISTA revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3629105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rates for Tikhonov regularisation of non-linear ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed learning with multi-penalty regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rates for total variation regularization of coefficient identification problems in elliptic equations I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rates for total variation regularization of coefficient identification problems in elliptic equations. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parameter Tikhonov regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rates and source conditions for Tikhonov regularization with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient descent for Tikhonov functionals with sparsity constraints: theory and numerical comparison of step size rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximité et dualité dans un espace hilbertien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing conductivity coefficients based on sparsity regularization and measured data in electrical impedance tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth Newton and quasi-Newton methods in weighted ℓ<sup>1</sup>-regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent gradient methods for nonsmooth minimization problems in ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-penalty regularization in learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parameter Tikhonov regularization with the ℓ <sup>0</sup> sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-019-00864-X / rank
 
Normal rank

Latest revision as of 04:20, 10 December 2024

scientific article
Language Label Description Also known as
English
Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
scientific article

    Statements

    Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization (English)
    0 references
    0 references
    0 references
    0 references
    6 January 2021
    0 references
    sparse matrix factorization
    0 references
    alternating proximal iteration
    0 references
    non-smooth optimization
    0 references
    non-linear inverse problems
    0 references
    sparsity regularization
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references