A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint (Q2149159): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q445823
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zheng-Jian Bai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3178578982 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2107.00809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection-like Retractions on Matrix Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / 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: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Construction of Sparse Probabilistic Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse probabilistic Boolean network problems: a partial proximal-type operator splitting method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On modeling credit defaults: A probabilistic Boolean network approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5251797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks / rank
 
Normal rank

Latest revision as of 12:22, 29 July 2024

scientific article
Language Label Description Also known as
English
A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
scientific article

    Statements

    A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint (English)
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    sparse least squares regression
    0 references
    probabilistic simplex constraint
    0 references
    \(\ell_1\)-regularization
    0 references
    geometric proximal gradient method
    0 references
    0 references
    0 references