Error bounds of Approximate Weak Rescaled Pure Greedy Algorithms - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Bing Jiang, Peixin Ye, Wan Li, Man Lu. Error bounds of Approximate Weak Rescaled Pure Greedy Algorithms. IJWMIP, 23(2), March 2025. [doi]

The following publications are possibly variants of this publication:

Efficiency of the weak Rescaled Pure Greedy AlgorithmBing Jiang, Peixin Ye. ijwmip, 19(4), 2021. [doi]

Stability of Weak Rescaled Pure Greedy AlgorithmsWan Li, Man Lu, Peixin Ye, Wenhui Zhang 0004. axioms, 14(6):446, 2025. [doi]

Optimality of the rescaled pure greedy learning algorithmsWenhui Zhang 0004, Peixin Ye, Shuo Xing. ijwmip, 21(2), March 2023. [doi]

Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy AlgorithmsWenhui Zhang, Peixin Ye, Shuo Xing, Xu Xu. axioms, 11(9):437, 2022. [doi]

Unified error estimate for weak biorthogonal Greedy algorithmsBing Jiang, Peixin Ye, Wenhui Zhang. ijwmip, 20(5), 2022. [doi]

The Equivalence of Three Types of Error Bounds for Weakly and Approximately Convex FunctionsSixuan Bai, Minghua Li, Chengwu Lu, Daoli Zhu, Sien Deng. jota, 194(1):220-245, 2022. [doi]

runs on WebDSL