IDEAS home Printed from https://ideas.repec.org/r/cor/louvrp/2510.html
   My bibliography  Save this item

Gradient methods for minimizing composite functions

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Quoc Tran-Dinh, 2019. "Proximal alternating penalty algorithms for nonsmooth constrained convex optimization," Computational Optimization and Applications, Springer, vol. 72(1), pages 1-43, January.
  2. Deyi Liu & Quoc Tran-Dinh, 2020. "An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 903-926, June.
  3. R. Díaz Millán & M. Pentón Machado, 2019. "Inexact proximal $$\epsilon $$ϵ-subgradient methods for composite convex optimization problems," Journal of Global Optimization, Springer, vol. 75(4), pages 1029-1060, December.
  4. Min Li & Xinxin Li & Xiaoming Yuan, 2015. "Convergence Analysis of the Generalized Alternating Direction Method of Multipliers with Logarithmic–Quadratic Proximal Regularization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 218-233, January.
  5. Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury, 2021. "Decomposition in derivative-free optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 269-292, October.
  6. Hao Wang & Hao Zeng & Jiashan Wang, 2022. "An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis," Computational Optimization and Applications, Springer, vol. 83(3), pages 967-997, December.
  7. Reza Eghbali & Maryam Fazel, 2017. "Decomposable norm minimization with proximal-gradient homotopy algorithm," Computational Optimization and Applications, Springer, vol. 66(2), pages 345-381, March.
  8. VÁZQUEZ-ALCOCER, Alan & SCHOEN, Eric D. & GOOS, Peter, 2018. "A mixed integer optimization approach for model selection in screening experiments," Working Papers 2018007, University of Antwerp, Faculty of Business and Economics.
  9. Hiva Ghanbari & Katya Scheinberg, 2018. "Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates," Computational Optimization and Applications, Springer, vol. 69(3), pages 597-627, April.
  10. Caihua Chen & Xiaoling Fu & Bingsheng He & Xiaoming Yuan, 2017. "On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 914-928, March.
  11. Lei Yang, 2024. "Proximal Gradient Method with Extrapolation and Line Search for a Class of Non-convex and Non-smooth Problems," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 68-103, January.
  12. Hongwei Liu & Ting Wang & Zexian Liu, 2022. "Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems," Computational Optimization and Applications, Springer, vol. 83(2), pages 651-691, November.
  13. Kaiwen Ma & Luis Miguel Rios & Atharv Bhosekar & Nikolaos V. Sahinidis & Sreekanth Rajagopalan, 2023. "Branch-and-Model: a derivative-free global optimization algorithm," Computational Optimization and Applications, Springer, vol. 85(2), pages 337-367, June.
  14. Ching-pei Lee & Stephen J. Wright, 2019. "Inexact Successive quadratic approximation for regularized optimization," Computational Optimization and Applications, Springer, vol. 72(3), pages 641-674, April.
  15. Farnè, Matteo & Montanari, Angela, 2020. "A large covariance matrix estimator under intermediate spikiness regimes," Journal of Multivariate Analysis, Elsevier, vol. 176(C).
  16. Luo, Bin & Gao, Xiaoli, 2022. "High-dimensional robust approximated M-estimators for mean regression with asymmetric data," Journal of Multivariate Analysis, Elsevier, vol. 192(C).
  17. Jiaming Liang & Renato D. C. Monteiro & Chee-Khian Sim, 2021. "A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems," Computational Optimization and Applications, Springer, vol. 79(3), pages 649-679, July.
  18. Adrien B. Taylor & Julien M. Hendrickx & François Glineur, 2018. "Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 455-476, August.
  19. Bin Luo & Xiaoli Gao, 2022. "A high-dimensional M-estimator framework for bi-level variable selection," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 74(3), pages 559-579, June.
  20. Majid Jahani & Naga Venkata C. Gudapati & Chenxin Ma & Rachael Tappenden & Martin Takáč, 2021. "Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences," Computational Optimization and Applications, Springer, vol. 79(2), pages 369-404, June.
  21. Yakui Huang & Hongwei Liu, 2016. "Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization," Computational Optimization and Applications, Springer, vol. 65(3), pages 671-698, December.
  22. Chin Pang Ho & Panos Parpas, 2019. "Empirical risk minimization: probabilistic complexity and stepsize strategy," Computational Optimization and Applications, Springer, vol. 73(2), pages 387-410, June.
  23. Naoki Marumo & Takayuki Okuno & Akiko Takeda, 2023. "Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares," Computational Optimization and Applications, Springer, vol. 84(3), pages 833-874, April.
  24. Aviad Aberdam & Amir Beck, 2022. "An Accelerated Coordinate Gradient Descent Algorithm for Non-separable Composite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 219-246, June.
  25. Zhongming Wu & Chongshou Li & Min Li & Andrew Lim, 2021. "Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 79(3), pages 617-644, March.
  26. Zhaosong Lu & Xiaojun Chen, 2018. "Generalized Conjugate Gradient Methods for ℓ 1 Regularized Convex Quadratic Programming with Finite Convergence," Mathematics of Operations Research, INFORMS, vol. 43(1), pages 275-303, February.
  27. NESTEROV, Yu. & SHIKHMAN, Vladimir, 2014. "Convergent subgradient methods for nonsmooth convex minimization," LIDAM Discussion Papers CORE 2014005, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  28. E. Loli Piccolomini & V. L. Coli & E. Morotti & L. Zanni, 2018. "Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm," Computational Optimization and Applications, Springer, vol. 71(1), pages 171-191, September.
  29. Christian Kanzow & Theresa Lechner, 2021. "Globalized inexact proximal Newton-type methods for nonconvex composite functions," Computational Optimization and Applications, Springer, vol. 78(2), pages 377-410, March.
  30. Dewei Zhang & Yin Liu & Sam Davanloo Tajbakhsh, 2022. "A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1126-1140, March.
  31. Pavel Dvurechensky & Alexander Gasnikov, 2016. "Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 121-145, October.
  32. Doikov, Nikita & Nesterov, Yurii, 2021. "Optimization Methods for Fully Composite Problems," LIDAM Discussion Papers CORE 2021001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  33. Xin Qu & Wei Bian, 2022. "Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 287-317, September.
  34. Quoc Tran-Dinh & Anastasios Kyrillidis & Volkan Cevher, 2018. "A Single-Phase, Proximal Path-Following Framework," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1326-1347, November.
  35. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
  36. Huynh Ngai & Ta Anh Son, 2022. "Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2)," Computational Optimization and Applications, Springer, vol. 83(2), pages 615-649, November.
  37. A. Scagliotti & P. Colli Franzone, 2022. "A piecewise conservative method for unconstrained convex optimization," Computational Optimization and Applications, Springer, vol. 81(1), pages 251-288, January.
  38. Saif Eddin Jabari & Nikolaos M. Freris & Deepthi Mary Dilip, 2020. "Sparse Travel Time Estimation from Streaming Data," Transportation Science, INFORMS, vol. 54(1), pages 1-20, January.
  39. Donghwan Kim & Jeffrey A. Fessler, 2018. "Adaptive Restart of the Optimized Gradient Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 178(1), pages 240-263, July.
  40. Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
  41. Hedy Attouch & Zaki Chbani & Jalal Fadili & Hassan Riahi, 2022. "Fast Convergence of Dynamical ADMM via Time Scaling of Damped Inertial Dynamics," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 704-736, June.
  42. Lorenzo Stella & Andreas Themelis & Panagiotis Patrinos, 2017. "Forward–backward quasi-Newton methods for nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 67(3), pages 443-487, July.
  43. Yangyang Xu & Shuzhong Zhang, 2018. "Accelerated primal–dual proximal block coordinate updating methods for constrained convex optimization," Computational Optimization and Applications, Springer, vol. 70(1), pages 91-128, May.
  44. Weibin Mo & Yufeng Liu, 2022. "Efficient learning of optimal individualized treatment rules for heteroscedastic or misspecified treatment‐free effect models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 440-472, April.
  45. Jie Zhang & Xinmin Yang & Gaoxi Li & Ke Zhang, 2023. "A smoothing proximal gradient algorithm with extrapolation for the relaxation of $${\ell_{0}}$$ ℓ 0 regularization problem," Computational Optimization and Applications, Springer, vol. 84(3), pages 737-760, April.
  46. Kimon Fountoulakis & Jacek Gondzio, 2016. "Performance of first- and second-order methods for $$\ell _1$$ ℓ 1 -regularized least squares problems," Computational Optimization and Applications, Springer, vol. 65(3), pages 605-635, December.
  47. Min Li & Xiaoming Yuan, 2015. "A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 842-858, October.
  48. Zhongming Wu & Min Li, 2019. "General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 73(1), pages 129-158, May.
  49. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  50. Liu, Yulan & Bi, Shujun, 2019. "Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 418-435.
  51. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
  52. Filip Hanzely & Peter Richtárik & Lin Xiao, 2021. "Accelerated Bregman proximal gradient methods for relatively smooth convex optimization," Computational Optimization and Applications, Springer, vol. 79(2), pages 405-440, June.
  53. Md Sarowar Morshed & Md Saiful Islam & Md. Noor-E-Alam, 2020. "Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem," Journal of Global Optimization, Springer, vol. 77(2), pages 361-382, June.
  54. Masoud Ahookhosh & Le Thi Khanh Hien & Nicolas Gillis & Panagiotis Patrinos, 2021. "Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization," Computational Optimization and Applications, Springer, vol. 79(3), pages 681-715, July.
  55. Niao He & Anatoli Juditsky & Arkadi Nemirovski, 2015. "Mirror Prox algorithm for multi-term composite minimization and semi-separable problems," Computational Optimization and Applications, Springer, vol. 61(2), pages 275-319, June.
  56. Weiwei Kong & Renato D. C. Monteiro, 2022. "Accelerated inexact composite gradient methods for nonconvex spectral optimization problems," Computational Optimization and Applications, Springer, vol. 82(3), pages 673-715, July.
  57. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
  58. J. C. De Los Reyes & E. Loayza & P. Merino, 2017. "Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ ℓ 1 -optimization," Computational Optimization and Applications, Springer, vol. 67(2), pages 225-258, June.
  59. Doikov, Nikita & Nesterov, Yurii, 2020. "Affine-invariant contracting-point methods for Convex Optimization," LIDAM Discussion Papers CORE 2020029, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  60. Olivier Fercoq & Zheng Qu, 2020. "Restarting the accelerated coordinate descent method with a rough strong convexity estimate," Computational Optimization and Applications, Springer, vol. 75(1), pages 63-91, January.
  61. Masoud Ahookhosh, 2019. "Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 319-353, June.
  62. Enrico Bernardi & Matteo Farnè, 2022. "A Log-Det Heuristics for Covariance Matrix Estimation: The Analytic Setup," Stats, MDPI, vol. 5(3), pages 1-11, July.
  63. Donghwan Kim & Jeffrey A. Fessler, 2017. "On the Convergence Analysis of the Optimized Gradient Method," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 187-205, January.
  64. Qihang Lin & Runchao Ma & Yangyang Xu, 2022. "Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization," Computational Optimization and Applications, Springer, vol. 82(1), pages 175-224, May.
  65. Haixin Ren & Bin Ge & Xiangwu Zhuge, 2023. "Fast Convergence of Inertial Gradient Dynamics with Multiscale Aspects," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 461-489, February.
  66. Cheik Traoré & Saverio Salzo & Silvia Villa, 2023. "Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization," Computational Optimization and Applications, Springer, vol. 86(1), pages 303-344, September.
  67. Fan Wu & Wei Bian, 2020. "Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem," Journal of Global Optimization, Springer, vol. 76(4), pages 819-840, April.
  68. Le Thi Khanh Hien & Renbo Zhao & William B. Haskell, 2024. "An Inexact Primal-Dual Smoothing Framework for Large-Scale Non-Bilinear Saddle Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 200(1), pages 34-67, January.
  69. Xiaoya Zhang & Wei Peng & Hui Zhang, 2022. "Inertial proximal incremental aggregated gradient method with linear convergence guarantees," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 96(2), pages 187-213, October.
  70. Yaohua Hu & Chong Li & Kaiwen Meng & Xiaoqi Yang, 2021. "Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems," Journal of Global Optimization, Springer, vol. 79(4), pages 853-883, April.
  71. Oumaima Benchettou & Abdeslem Hafid Bentbib & Abderrahman Bouhamidi, 2023. "An Accelerated Tensorial Double Proximal Gradient Method for Total Variation Regularization Problem," Journal of Optimization Theory and Applications, Springer, vol. 198(1), pages 111-134, July.
  72. Stefania Bellavia & Gianmarco Gurioli & Benedetta Morini & Philippe Louis Toint, 2023. "The Impact of Noise on Evaluation Complexity: The Deterministic Trust-Region Case," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 700-729, February.
  73. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
  74. Masaru Ito & Mituhiro Fukuda, 2021. "Nearly Optimal First-Order Methods for Convex Optimization under Gradient Norm Measure: an Adaptive Regularization Approach," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 770-804, March.
  75. Sun, Shilin & Wang, Tianyang & Yang, Hongxing & Chu, Fulei, 2022. "Damage identification of wind turbine blades using an adaptive method for compressive beamforming based on the generalized minimax-concave penalty function," Renewable Energy, Elsevier, vol. 181(C), pages 59-70.
  76. Yunier Bello-Cruz & Max L. N. Gonçalves & Nathan Krislock, 2023. "On FISTA with a relative error rule," Computational Optimization and Applications, Springer, vol. 84(2), pages 295-318, March.
  77. Guillaume O. Berger & P.-A. Absil & Raphaël M. Jungers & Yurii Nesterov, 2020. "On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient," Journal of Optimization Theory and Applications, Springer, vol. 185(1), pages 17-33, April.
  78. Le Thi Khanh Hien & Cuong V. Nguyen & Huan Xu & Canyi Lu & Jiashi Feng, 2019. "Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 541-566, May.
  79. Patrick R. Johnstone & Pierre Moulin, 2017. "Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions," Computational Optimization and Applications, Springer, vol. 67(2), pages 259-292, June.
  80. Bo Wen & Xiaojun Chen & Ting Kei Pong, 2018. "A proximal difference-of-convex algorithm with extrapolation," Computational Optimization and Applications, Springer, vol. 69(2), pages 297-324, March.
  81. Peiran Yu & Ting Kei Pong, 2019. "Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation," Computational Optimization and Applications, Springer, vol. 73(2), pages 353-386, June.
  82. Jian Huang & Yuling Jiao & Lican Kang & Jin Liu & Yanyan Liu & Xiliang Lu, 2022. "GSDAR: a fast Newton algorithm for $$\ell _0$$ ℓ 0 regularized generalized linear models with statistical guarantee," Computational Statistics, Springer, vol. 37(1), pages 507-533, March.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.