A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m×n real matrix space with application in image clustering
Box-constrained optimization problems in the real m×n matrix space have been widely applied in big data mining. However, efficient solution of them is still a challenge. In this paper, a new nonmonotone line search rule is first proposed by extending the well-known ones and inheriting their advantag...
Gespeichert in:
| Veröffentlicht in: | Journal of computational and applied mathematics Jg. 438; S. 115563 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.03.2024
|
| Schlagworte: | |
| ISSN: | 0377-0427, 1879-1778 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Box-constrained optimization problems in the real m×n matrix space have been widely applied in big data mining. However, efficient solution of them is still a challenge. In this paper, a new nonmonotone line search rule is first proposed by extending the well-known ones and inheriting their advantages. Then, by analyzing and exploiting properties of this rule, a new nonmonotone spectral projected gradient algorithm is developed to solve the box-constrained optimization problems in the matrix space. Global convergence of the developed algorithm is also established. Numerical tests are conducted on a series of randomly generated test problems and those in the set of benchmark test problems. Compared with other existing nonmonotone line search rules, our rule shows its advantages in terms of the significantly reduced number of function evaluations and significantly reduced number of iterations. To further validate applicability of this research, we apply the studied optimization problem and the developed algorithm to solve the problems of image clustering. Numerical results demonstrate that the proposed method can generate better clustering results and is more robust than the similar ones available in the literature. |
|---|---|
| AbstractList | Box-constrained optimization problems in the real m×n matrix space have been widely applied in big data mining. However, efficient solution of them is still a challenge. In this paper, a new nonmonotone line search rule is first proposed by extending the well-known ones and inheriting their advantages. Then, by analyzing and exploiting properties of this rule, a new nonmonotone spectral projected gradient algorithm is developed to solve the box-constrained optimization problems in the matrix space. Global convergence of the developed algorithm is also established. Numerical tests are conducted on a series of randomly generated test problems and those in the set of benchmark test problems. Compared with other existing nonmonotone line search rules, our rule shows its advantages in terms of the significantly reduced number of function evaluations and significantly reduced number of iterations. To further validate applicability of this research, we apply the studied optimization problem and the developed algorithm to solve the problems of image clustering. Numerical results demonstrate that the proposed method can generate better clustering results and is more robust than the similar ones available in the literature. |
| ArticleNumber | 115563 |
| Author | Li, Ting Wan, Zhong Guo, Jie |
| Author_xml | – sequence: 1 givenname: Ting surname: Li fullname: Li, Ting email: litingmath@163.com organization: School of Mathematics and Statistic, Central South University, Changsha 410083, Hunan, PR China – sequence: 2 givenname: Zhong surname: Wan fullname: Wan, Zhong email: wanmath@csu.edu.cn organization: School of Mathematics and Statistic, Central South University, Changsha 410083, Hunan, PR China – sequence: 3 givenname: Jie surname: Guo fullname: Guo, Jie email: 353208037@qq.com organization: School of Mathematical Sciences, Changsha Normal University, Changsha 410111, Hunan, PR China |
| BookMark | eNp9kM1OAyEURompiW31AdzxAlOBYcpMXDWNf0kTN7omFO5UmhmYAFr1Rdz6Lr6Y1Lpy4Yq7-M53uWeCRs47QOickhkldH6xnWnVzxhh5YzSqpqXR2hMa9EUVIh6hMakFKIgnIkTNIlxSwiZN5SP0ecCO9jh3NZ751MuxXEAnYLq8BD8No9g8CYoY8ElrLqNDzY99bj1Aa_9a6G9izltXY75IdnevqtkvdvT6w76iK3D_deHwwFyZ69SsK95h9KAd7kJq2HorD4wOWp7tQGsu-eYIFi3OUXHreoinP2-U_R4ffWwvC1W9zd3y8Wq0IyyVFSlqYU2DacKSqEUF7oGo2nDVcUrwhrNTK0Jq9q24Y2hpKqBrhkwvmZ1zVU5RfTQq4OPMUArh5D_Et4kJXKvWG5lViz3iuVBcWbEH0bb9HPJ3kj3L3l5ICGf9GIhyKizYA3GhqxcGm__ob8BNCKdhQ |
| CitedBy_id | crossref_primary_10_1016_j_patcog_2025_111650 crossref_primary_10_1002_advs_202411325 crossref_primary_10_1016_j_apnum_2024_10_015 |
| Cites_doi | 10.1016/j.cam.2017.09.026 10.1137/S1052623497330963 10.1137/S106482759427021X 10.1137/050635225 10.1007/s10618-014-0390-x 10.1016/j.apm.2016.10.055 10.1145/3534678.3539317 10.1007/BF01385810 10.1016/j.camwa.2007.08.038 10.1007/s10957-012-0239-7 10.1109/TSMC.2018.2820084 10.1016/j.neucom.2021.05.100 10.1109/TSP.2012.2190406 10.1109/TKDE.2012.51 10.1016/j.cam.2005.06.033 10.1137/120887795 10.1023/A:1013653923062 10.1007/s11075-014-9866-4 10.1016/j.knosys.2022.109222 10.1093/imanum/8.1.141 10.1162/neco.2007.19.10.2756 10.2140/pjm.1966.16.1 10.1016/j.patrec.2009.09.011 10.1109/TNNLS.2015.2412037 10.1137/S1052623403428208 10.1016/S0167-6377(99)00074-7 10.1016/j.cam.2016.09.014 10.1109/TCSS.2022.3154030 10.1007/s101070100263 10.1137/0723046 10.1016/j.compchemeng.2020.106902 10.1109/TSP.2006.881199 10.4208/nmtma.OA-2019-0028 10.1016/j.cor.2021.105506 10.1007/s10618-021-00773-5 10.1007/s10915-021-01489-w 10.1080/00207160.2020.1723562 10.1080/02331934.2011.641126 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cam.2023.115563 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1879-1778 |
| ExternalDocumentID | 10_1016_j_cam_2023_115563 S0377042723005071 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO ABAOU ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSW T5K TN5 UPT XPP YQT ZMT ~02 ~G- 29K 5VS 9DU AAFWJ AAQFI AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION D-I EFKBS EJD FGOYB G-2 HZ~ NHB R2- SSZ WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c212t-53d87cd941ae37aa47c8edc194a545029c2d8c025ff949d1058e1b2e24b2884a3 |
| ISSN | 0377-0427 |
| IngestDate | Sat Nov 29 07:24:36 EST 2025 Tue Nov 18 21:44:38 EST 2025 Fri Feb 23 02:35:37 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Line search 90C30 65K05 Algorithms Optimization Convergence |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c212t-53d87cd941ae37aa47c8edc194a545029c2d8c025ff949d1058e1b2e24b2884a3 |
| ParticipantIDs | crossref_primary_10_1016_j_cam_2023_115563 crossref_citationtrail_10_1016_j_cam_2023_115563 elsevier_sciencedirect_doi_10_1016_j_cam_2023_115563 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-03-01 2024-03-00 |
| PublicationDateYYYYMMDD | 2024-03-01 |
| PublicationDate_xml | – month: 03 year: 2024 text: 2024-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of computational and applied mathematics |
| PublicationYear | 2024 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Li, Li, Liu (b26) 2021; 98 Grippo, Sciandrone (b36) 2000; 26 Xu, Yin (b37) 2013; 6 Tso, Burnak, Pistikopoulos (b30) 2020; 139 Ahookhosh, Amini, Bahrami (b13) 2012; 61 Armijo (b5) 1966; 16 Deng, Li, Wang, Wang, Horng, Liu (b35) 2023; 10 Gu, Mo (b12) 2008; 55 Li, Tang, Wan (b3) 2021; 35 Wang, Zhang (b2) 2013; 25 Zhao, Jolaoso, Shehu, Yao (b21) 2021; 5 Li, Li, Liu (b25) 2020; 13 Toint (b7) 1996; 17 Jain (b32) 2010; 31 Huang, Wan (b16) 2018; 330 Huang, Wan (b14) 2015; 68 Tang, Wan (b1) 2021; 87 Han, Neumann, Prasad (b23) 2009; 36 Lin (b29) 2007; 19 Hager, Zhang (b22) 2006; 17 Tang, Hui (b33) 2022; 251 Grippo, Lampariello, Lucidi (b8) 1991; 59 Huang, Liu, Zhou (b24) 2015; 29 Dai (b9) 2002; 112 B. Hui, W.-S. Ku, Low-rank nonnegative tensor decomposition in hyperbolic space, in: Proceedings of the 28th ACM SIGKDD, Washington, DC, USA, 2022, pp. 646–654 Shi, Shen (b11) 2006; 193 Aharon, Elad, Bruckstein (b41) 2006; 54 Birgin, Martínez, Raydan (b20) 2000; 10 Guan, Tao, Luo, Yuan (b38) 2012; 60 . Deng, Wan (b17) 2012; 157 Ghalavand, Khorram, Morovati (b18) 2021; 136 Huang, Wan (b19) 2017; 313 Ahookhosh, Ghaderi (b15) 2017; 43 Yang, Zhang, Xiang, Yan, Xie (b34) 2020; 50 Dolan, Moré (b31) 2002; 91 Nocedal, Wright (b4) 2006 Zhang, Hager (b10) 2004; 14 Ding, Tang, Guo (b39) 2021; 461 Li, Wan (b27) 2019; 61 Luo, Zhou, Xia, Zhu, Ammari, Alabdulwahab (b40) 2016; 27 Barzilai, Borwein (b28) 1988; 8 Grippo, Lampariello, Lucidi (b6) 1986; 23 Birgin (10.1016/j.cam.2023.115563_b20) 2000; 10 Aharon (10.1016/j.cam.2023.115563_b41) 2006; 54 Zhang (10.1016/j.cam.2023.115563_b10) 2004; 14 Dai (10.1016/j.cam.2023.115563_b9) 2002; 112 Huang (10.1016/j.cam.2023.115563_b19) 2017; 313 Huang (10.1016/j.cam.2023.115563_b14) 2015; 68 Yang (10.1016/j.cam.2023.115563_b34) 2020; 50 Deng (10.1016/j.cam.2023.115563_b35) 2023; 10 Shi (10.1016/j.cam.2023.115563_b11) 2006; 193 Barzilai (10.1016/j.cam.2023.115563_b28) 1988; 8 Tso (10.1016/j.cam.2023.115563_b30) 2020; 139 Ding (10.1016/j.cam.2023.115563_b39) 2021; 461 Ahookhosh (10.1016/j.cam.2023.115563_b13) 2012; 61 Li (10.1016/j.cam.2023.115563_b3) 2021; 35 Li (10.1016/j.cam.2023.115563_b26) 2021; 98 Luo (10.1016/j.cam.2023.115563_b40) 2016; 27 Ghalavand (10.1016/j.cam.2023.115563_b18) 2021; 136 10.1016/j.cam.2023.115563_b42 Tang (10.1016/j.cam.2023.115563_b1) 2021; 87 Jain (10.1016/j.cam.2023.115563_b32) 2010; 31 Wang (10.1016/j.cam.2023.115563_b2) 2013; 25 Tang (10.1016/j.cam.2023.115563_b33) 2022; 251 Gu (10.1016/j.cam.2023.115563_b12) 2008; 55 Grippo (10.1016/j.cam.2023.115563_b36) 2000; 26 Hager (10.1016/j.cam.2023.115563_b22) 2006; 17 Nocedal (10.1016/j.cam.2023.115563_b4) 2006 Xu (10.1016/j.cam.2023.115563_b37) 2013; 6 Guan (10.1016/j.cam.2023.115563_b38) 2012; 60 Grippo (10.1016/j.cam.2023.115563_b8) 1991; 59 Li (10.1016/j.cam.2023.115563_b25) 2020; 13 Toint (10.1016/j.cam.2023.115563_b7) 1996; 17 Zhao (10.1016/j.cam.2023.115563_b21) 2021; 5 Ahookhosh (10.1016/j.cam.2023.115563_b15) 2017; 43 Grippo (10.1016/j.cam.2023.115563_b6) 1986; 23 Huang (10.1016/j.cam.2023.115563_b16) 2018; 330 Deng (10.1016/j.cam.2023.115563_b17) 2012; 157 Armijo (10.1016/j.cam.2023.115563_b5) 1966; 16 Dolan (10.1016/j.cam.2023.115563_b31) 2002; 91 Lin (10.1016/j.cam.2023.115563_b29) 2007; 19 Han (10.1016/j.cam.2023.115563_b23) 2009; 36 Huang (10.1016/j.cam.2023.115563_b24) 2015; 29 Li (10.1016/j.cam.2023.115563_b27) 2019; 61 |
| References_xml | – volume: 59 start-page: 779 year: 1991 end-page: 805 ident: b8 article-title: A class of nonmonotone stabilization methods in unconstrained optimization publication-title: Numer. Math. – volume: 35 start-page: 1972 year: 2021 end-page: 2008 ident: b3 article-title: An alternating nonmonotone projected Barzilai–Borwein algorithm of nonnegative factorization of big matrices publication-title: Data Min. Knowl. Discov. – volume: 251 year: 2022 ident: b33 article-title: Robust collaborative clustering approach with adaptive local structure learning publication-title: Knowl.-Based Syst. – volume: 16 start-page: 1 year: 1966 end-page: 3 ident: b5 article-title: Minimization of functions having Lipschitz continuous first partial derivatives publication-title: Pacific J. Math. – volume: 112 start-page: 315 year: 2002 end-page: 330 ident: b9 article-title: On the nonmonotone line search publication-title: J. Optim. Theory Appl. – volume: 19 start-page: 2756 year: 2007 end-page: 2779 ident: b29 article-title: Projected gradient methods for nonnegative matrix factorization publication-title: Neural Comput. – volume: 60 start-page: 2882 year: 2012 end-page: 2898 ident: b38 article-title: NeNMF: An optimal gradient method for nonnegative matrix factorization publication-title: IEEE Trans. Signal Process. – reference: B. Hui, W.-S. Ku, Low-rank nonnegative tensor decomposition in hyperbolic space, in: Proceedings of the 28th ACM SIGKDD, Washington, DC, USA, 2022, pp. 646–654, – volume: 5 start-page: 441 year: 2021 end-page: 457 ident: b21 article-title: Convergence of a nonmonotone projected gradient methods for nonconvex multiobjective optimization publication-title: J. Nonlinear Var. Anal. – volume: 36 start-page: 54 year: 2009 end-page: 82 ident: b23 article-title: Alternating projected Barzilai–Borwein methods for nonnegative matrix factorization publication-title: Electron. Trans. Numer. Anal. – volume: 8 start-page: 141 year: 1988 end-page: 148 ident: b28 article-title: Two-point step length gradient methods publication-title: IMA J. Numer. Anal. – volume: 54 start-page: 4311 year: 2006 end-page: 4322 ident: b41 article-title: K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation publication-title: IEEE Trans. Signal Process. – volume: 193 start-page: 397 year: 2006 end-page: 412 ident: b11 article-title: Convergence of nonmonotone line search method publication-title: J. Comput. Appl. Math. – volume: 330 start-page: 586 year: 2018 end-page: 604 ident: b16 article-title: An extended nonmonotone line search technique for large-scale unconstrained optimization publication-title: J. Comput. Appl. Math. – volume: 29 start-page: 1665 year: 2015 end-page: 1684 ident: b24 article-title: Quadratic regularization projected Barzilai–Borwein method for nonnegative matrix factorization publication-title: Data Min. Knowl. Discov. – volume: 6 start-page: 1758 year: 2013 end-page: 1789 ident: b37 article-title: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion publication-title: SIAM J. Imaging Sci. – volume: 61 start-page: 76 year: 2019 end-page: 98 ident: b27 article-title: New adaptive Barzilai–Borwein step length and its application in solving large scale optimization problems publication-title: ANZIAM J. – volume: 55 start-page: 2158 year: 2008 end-page: 2172 ident: b12 article-title: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization publication-title: Comput. Math. Appl. – volume: 13 start-page: 516 year: 2020 end-page: 538 ident: b25 article-title: An adaptive nonmonotone projected Barzilai–Borwein gradient method with active set prediction for nonnegative matrix factorization publication-title: Numer. Math. Theor. Methods Appl. – volume: 43 start-page: 170 year: 2017 end-page: 190 ident: b15 article-title: On efficiency of nonmonotone Armijo-type line searches publication-title: Appl. Math. Model. – volume: 91 start-page: 201 year: 2002 end-page: 213 ident: b31 article-title: Benchmarking optimization software with performance profiles publication-title: Math. Program. – volume: 68 start-page: 671 year: 2015 end-page: 689 ident: b14 article-title: A new nonmonotone line search technique for unconstrained optimization publication-title: Numer. Algorithms – volume: 50 start-page: 2524 year: 2020 end-page: 2533 ident: b34 article-title: Nonnegative matrix factorization with dual constraints for image clustering publication-title: IEEE Trans. Syst. Man Cybern.-Syst. – year: 2006 ident: b4 article-title: Numerical Optimization – volume: 10 start-page: 1196 year: 2000 end-page: 1211 ident: b20 article-title: Nonmonotone spectral projected gradient methods on convex sets publication-title: SIAM J. Optim. – volume: 26 start-page: 127 year: 2000 end-page: 136 ident: b36 article-title: On the convergence of the block nonlinear Gauss–Seidel method under convex constraints publication-title: Oper. Res. Lett. – volume: 23 start-page: 707 year: 1986 end-page: 716 ident: b6 article-title: A nonmonotone line search technique for Newton’s method publication-title: SIAM J. Numer. Anal. – volume: 98 start-page: 11 year: 2021 end-page: 27 ident: b26 article-title: An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation publication-title: Int. J. Comput. Math. – reference: . – volume: 87 start-page: 66 year: 2021 ident: b1 article-title: Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering publication-title: J. Sci. Comput. – volume: 136 year: 2021 ident: b18 article-title: An adaptive nonmonotone line search for multiobjective optimization problems publication-title: Comput. Oper. Res. – volume: 157 start-page: 820 year: 2012 end-page: 842 ident: b17 article-title: An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems publication-title: J. Optim. Theory Appl. – volume: 27 start-page: 524 year: 2016 end-page: 537 ident: b40 article-title: Generating highly accurate predictions for missing QoS data via aggregating nonnegative latent factor models publication-title: IEEE Trans. Neural Netw. Learn. Syst. – volume: 17 start-page: 526 year: 2006 end-page: 557 ident: b22 article-title: A new active set algorithm for box constrained optimization publication-title: SIAM J. Optim. – volume: 61 start-page: 387 year: 2012 end-page: 404 ident: b13 article-title: A class of nonmonotone Armijo-type line search method for unconstrained optimization publication-title: Optimization – volume: 25 start-page: 1336 year: 2013 end-page: 1353 ident: b2 article-title: Nonnegative matrix factorization: A comprehensive review publication-title: IEEE Trans. Knowl. Data Eng. – volume: 17 start-page: 725 year: 1996 end-page: 739 ident: b7 article-title: An assessment of nonmonotone line search technique for unconstrained optimization publication-title: SIAM J. Sci. Comput. – volume: 14 start-page: 1043 year: 2004 end-page: 1056 ident: b10 article-title: A nonmonotone line search technique and its application to unconstrained optimization publication-title: SIAM J. Optim. – volume: 139 year: 2020 ident: b30 article-title: HY-POP: Hyperparameter optimization of machine learning models through parametric programming publication-title: Comput. Chem. Eng. – volume: 31 start-page: 651 year: 2010 end-page: 666 ident: b32 article-title: Data clustering: 50 years beyond K-means publication-title: Pattern Recognit. Lett. – volume: 461 start-page: 618 year: 2021 end-page: 631 ident: b39 article-title: Identification of drug-target interactions via multi-view graph regularized link propagation model publication-title: Neurocomputing – volume: 313 start-page: 82 year: 2017 end-page: 101 ident: b19 article-title: A new nonmonotone spectral residual method for nonsmooth nonlinear equations publication-title: J. Comput. Appl. Math. – volume: 10 start-page: 910 year: 2023 end-page: 921 ident: b35 article-title: Graph regularized sparse non-negative matrix factorization for clustering publication-title: IEEE Trans. Comput. Soc. Syst. – volume: 330 start-page: 586 year: 2018 ident: 10.1016/j.cam.2023.115563_b16 article-title: An extended nonmonotone line search technique for large-scale unconstrained optimization publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2017.09.026 – volume: 10 start-page: 1196 year: 2000 ident: 10.1016/j.cam.2023.115563_b20 article-title: Nonmonotone spectral projected gradient methods on convex sets publication-title: SIAM J. Optim. doi: 10.1137/S1052623497330963 – volume: 17 start-page: 725 year: 1996 ident: 10.1016/j.cam.2023.115563_b7 article-title: An assessment of nonmonotone line search technique for unconstrained optimization publication-title: SIAM J. Sci. Comput. doi: 10.1137/S106482759427021X – volume: 17 start-page: 526 year: 2006 ident: 10.1016/j.cam.2023.115563_b22 article-title: A new active set algorithm for box constrained optimization publication-title: SIAM J. Optim. doi: 10.1137/050635225 – volume: 29 start-page: 1665 year: 2015 ident: 10.1016/j.cam.2023.115563_b24 article-title: Quadratic regularization projected Barzilai–Borwein method for nonnegative matrix factorization publication-title: Data Min. Knowl. Discov. doi: 10.1007/s10618-014-0390-x – year: 2006 ident: 10.1016/j.cam.2023.115563_b4 – volume: 43 start-page: 170 year: 2017 ident: 10.1016/j.cam.2023.115563_b15 article-title: On efficiency of nonmonotone Armijo-type line searches publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2016.10.055 – ident: 10.1016/j.cam.2023.115563_b42 doi: 10.1145/3534678.3539317 – volume: 59 start-page: 779 year: 1991 ident: 10.1016/j.cam.2023.115563_b8 article-title: A class of nonmonotone stabilization methods in unconstrained optimization publication-title: Numer. Math. doi: 10.1007/BF01385810 – volume: 55 start-page: 2158 year: 2008 ident: 10.1016/j.cam.2023.115563_b12 article-title: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization publication-title: Comput. Math. Appl. doi: 10.1016/j.camwa.2007.08.038 – volume: 157 start-page: 820 year: 2012 ident: 10.1016/j.cam.2023.115563_b17 article-title: An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-012-0239-7 – volume: 50 start-page: 2524 year: 2020 ident: 10.1016/j.cam.2023.115563_b34 article-title: Nonnegative matrix factorization with dual constraints for image clustering publication-title: IEEE Trans. Syst. Man Cybern.-Syst. doi: 10.1109/TSMC.2018.2820084 – volume: 461 start-page: 618 year: 2021 ident: 10.1016/j.cam.2023.115563_b39 article-title: Identification of drug-target interactions via multi-view graph regularized link propagation model publication-title: Neurocomputing doi: 10.1016/j.neucom.2021.05.100 – volume: 60 start-page: 2882 year: 2012 ident: 10.1016/j.cam.2023.115563_b38 article-title: NeNMF: An optimal gradient method for nonnegative matrix factorization publication-title: IEEE Trans. Signal Process. doi: 10.1109/TSP.2012.2190406 – volume: 25 start-page: 1336 year: 2013 ident: 10.1016/j.cam.2023.115563_b2 article-title: Nonnegative matrix factorization: A comprehensive review publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2012.51 – volume: 36 start-page: 54 year: 2009 ident: 10.1016/j.cam.2023.115563_b23 article-title: Alternating projected Barzilai–Borwein methods for nonnegative matrix factorization publication-title: Electron. Trans. Numer. Anal. – volume: 193 start-page: 397 year: 2006 ident: 10.1016/j.cam.2023.115563_b11 article-title: Convergence of nonmonotone line search method publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2005.06.033 – volume: 6 start-page: 1758 year: 2013 ident: 10.1016/j.cam.2023.115563_b37 article-title: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion publication-title: SIAM J. Imaging Sci. doi: 10.1137/120887795 – volume: 112 start-page: 315 year: 2002 ident: 10.1016/j.cam.2023.115563_b9 article-title: On the nonmonotone line search publication-title: J. Optim. Theory Appl. doi: 10.1023/A:1013653923062 – volume: 68 start-page: 671 year: 2015 ident: 10.1016/j.cam.2023.115563_b14 article-title: A new nonmonotone line search technique for unconstrained optimization publication-title: Numer. Algorithms doi: 10.1007/s11075-014-9866-4 – volume: 251 year: 2022 ident: 10.1016/j.cam.2023.115563_b33 article-title: Robust collaborative clustering approach with adaptive local structure learning publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2022.109222 – volume: 61 start-page: 76 year: 2019 ident: 10.1016/j.cam.2023.115563_b27 article-title: New adaptive Barzilai–Borwein step length and its application in solving large scale optimization problems publication-title: ANZIAM J. – volume: 8 start-page: 141 year: 1988 ident: 10.1016/j.cam.2023.115563_b28 article-title: Two-point step length gradient methods publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/8.1.141 – volume: 19 start-page: 2756 year: 2007 ident: 10.1016/j.cam.2023.115563_b29 article-title: Projected gradient methods for nonnegative matrix factorization publication-title: Neural Comput. doi: 10.1162/neco.2007.19.10.2756 – volume: 16 start-page: 1 year: 1966 ident: 10.1016/j.cam.2023.115563_b5 article-title: Minimization of functions having Lipschitz continuous first partial derivatives publication-title: Pacific J. Math. doi: 10.2140/pjm.1966.16.1 – volume: 31 start-page: 651 year: 2010 ident: 10.1016/j.cam.2023.115563_b32 article-title: Data clustering: 50 years beyond K-means publication-title: Pattern Recognit. Lett. doi: 10.1016/j.patrec.2009.09.011 – volume: 27 start-page: 524 year: 2016 ident: 10.1016/j.cam.2023.115563_b40 article-title: Generating highly accurate predictions for missing QoS data via aggregating nonnegative latent factor models publication-title: IEEE Trans. Neural Netw. Learn. Syst. doi: 10.1109/TNNLS.2015.2412037 – volume: 14 start-page: 1043 year: 2004 ident: 10.1016/j.cam.2023.115563_b10 article-title: A nonmonotone line search technique and its application to unconstrained optimization publication-title: SIAM J. Optim. doi: 10.1137/S1052623403428208 – volume: 26 start-page: 127 year: 2000 ident: 10.1016/j.cam.2023.115563_b36 article-title: On the convergence of the block nonlinear Gauss–Seidel method under convex constraints publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(99)00074-7 – volume: 313 start-page: 82 year: 2017 ident: 10.1016/j.cam.2023.115563_b19 article-title: A new nonmonotone spectral residual method for nonsmooth nonlinear equations publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2016.09.014 – volume: 10 start-page: 910 year: 2023 ident: 10.1016/j.cam.2023.115563_b35 article-title: Graph regularized sparse non-negative matrix factorization for clustering publication-title: IEEE Trans. Comput. Soc. Syst. doi: 10.1109/TCSS.2022.3154030 – volume: 91 start-page: 201 year: 2002 ident: 10.1016/j.cam.2023.115563_b31 article-title: Benchmarking optimization software with performance profiles publication-title: Math. Program. doi: 10.1007/s101070100263 – volume: 23 start-page: 707 year: 1986 ident: 10.1016/j.cam.2023.115563_b6 article-title: A nonmonotone line search technique for Newton’s method publication-title: SIAM J. Numer. Anal. doi: 10.1137/0723046 – volume: 139 year: 2020 ident: 10.1016/j.cam.2023.115563_b30 article-title: HY-POP: Hyperparameter optimization of machine learning models through parametric programming publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2020.106902 – volume: 54 start-page: 4311 year: 2006 ident: 10.1016/j.cam.2023.115563_b41 article-title: K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation publication-title: IEEE Trans. Signal Process. doi: 10.1109/TSP.2006.881199 – volume: 13 start-page: 516 year: 2020 ident: 10.1016/j.cam.2023.115563_b25 article-title: An adaptive nonmonotone projected Barzilai–Borwein gradient method with active set prediction for nonnegative matrix factorization publication-title: Numer. Math. Theor. Methods Appl. doi: 10.4208/nmtma.OA-2019-0028 – volume: 136 year: 2021 ident: 10.1016/j.cam.2023.115563_b18 article-title: An adaptive nonmonotone line search for multiobjective optimization problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105506 – volume: 35 start-page: 1972 year: 2021 ident: 10.1016/j.cam.2023.115563_b3 article-title: An alternating nonmonotone projected Barzilai–Borwein algorithm of nonnegative factorization of big matrices publication-title: Data Min. Knowl. Discov. doi: 10.1007/s10618-021-00773-5 – volume: 87 start-page: 66 year: 2021 ident: 10.1016/j.cam.2023.115563_b1 article-title: Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering publication-title: J. Sci. Comput. doi: 10.1007/s10915-021-01489-w – volume: 5 start-page: 441 year: 2021 ident: 10.1016/j.cam.2023.115563_b21 article-title: Convergence of a nonmonotone projected gradient methods for nonconvex multiobjective optimization publication-title: J. Nonlinear Var. Anal. – volume: 98 start-page: 11 year: 2021 ident: 10.1016/j.cam.2023.115563_b26 article-title: An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation publication-title: Int. J. Comput. Math. doi: 10.1080/00207160.2020.1723562 – volume: 61 start-page: 387 year: 2012 ident: 10.1016/j.cam.2023.115563_b13 article-title: A class of nonmonotone Armijo-type line search method for unconstrained optimization publication-title: Optimization doi: 10.1080/02331934.2011.641126 |
| SSID | ssj0006914 |
| Score | 2.404929 |
| Snippet | Box-constrained optimization problems in the real m×n matrix space have been widely applied in big data mining. However, efficient solution of them is still a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 115563 |
| SubjectTerms | Algorithms Convergence Line search Optimization |
| Title | A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in m×n real matrix space with application in image clustering |
| URI | https://dx.doi.org/10.1016/j.cam.2023.115563 |
| Volume | 438 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-1778 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006914 issn: 0377-0427 databaseCode: AIEXJ dateStart: 20211213 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELaqLgc4IJ5ieckHTlRGjePU9rFCy0vLCokFVVwi10l3s2qSVWlX_SdcufMz-GPM2HESbQEBEpeosuw4yXydGdsz3xDyhJuxAbO-YMoKwYTkgpn5RDCeGA2aUpnYBdF8PJRHR2o20-8Gg28hF-ZiKatKbbf6_L-KGtpA2Jg6-xfibm8KDfAbhA5XEDtc_0jwU6wSPoJVPcxYI9X2yGVTYiJ-s-0CPubJyoV64X7vSb0q1qelj9ust8yix4iFI6BbDQqlbDI1R03tGRdAW-IBu5aYC4PpJ8jzv4V5DGgJny3XnYtj96LE0CC73CAtQzCWuy6xdSUmwvako5FtnOSyZZdt1wCHhcdaczd3KOBU6KfTumt7ufFHS0Xe398ArLQBXn7TbSfxxid7ScmwTIg3Y153K6lZJH1FoKDcheeO2TEUfs_i7Jk1SEfAYzAdSJXWWcU2VvE9zoVTcWT2HyNfwR6XiVZDsjd9fTB70xr-ifZU8uHZwiG6Cye8NNHP3aCea3N8g1xvBECnHks3ySCvbpFrb7tPfpt8nVJAFe2higZU0RZVNKCKtqiigCp6CVW0jyoaUEWLipbfv1QUEUU9oqhDFEVE0R6isKtDFO0QdYd8eHFw_PwVa4p7MAs6YM2SOFPSZlpEJo-lMUJalWc20sKAUz_m2vJMWfDIFwstdAbLAJVHc55zMedKCRPfJUN46fweoQn43JGdx-D5c7HAo2ExycGuLKxJJiYy-2QcvnVqG-Z7fONlGkIcz1IQT4riSb149snTdsi5p335XWcRBJg2fqv3R1NA26-H3f-3YQ_I1e5v8pAM16tN_ohcsRfr4vPqcYPJHxByw0Y |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+new+nonmonotone+spectral+projected+gradient+algorithm+for+box-constrained+optimization+problems+in+m%C3%97n+real+matrix+space+with+application+in+image+clustering&rft.jtitle=Journal+of+computational+and+applied+mathematics&rft.au=Li%2C+Ting&rft.au=Wan%2C+Zhong&rft.au=Guo%2C+Jie&rft.date=2024-03-01&rft.pub=Elsevier+B.V&rft.issn=0377-0427&rft.eissn=1879-1778&rft.volume=438&rft_id=info:doi/10.1016%2Fj.cam.2023.115563&rft.externalDocID=S0377042723005071 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-0427&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-0427&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-0427&client=summon |