An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions (Q6175564): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new generalized shrinkage conjugate gradient method for sparse recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Barzilai-Borwein type method for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Newton-Type Methods for Minimizing Composite Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaling Variable Metric (SSVM) Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal conditioning of self-scaling variable Metric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Reconstruction by Separable Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization / rank
 
Normal rank

Latest revision as of 09:32, 2 August 2024

scientific article; zbMATH DE number 7716039
Language Label Description Also known as
English
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions
scientific article; zbMATH DE number 7716039

    Statements

    An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions (English)
    0 references
    0 references
    0 references
    24 July 2023
    0 references
    nonsmooth optimization
    0 references
    composite function
    0 references
    proximal operator
    0 references
    symmetric rank-one updating formula
    0 references
    nonmonotone line search
    0 references
    0 references

    Identifiers

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