An Efficient Algorithm Based on Descent Direction for Nonsmooth Optimization and its Application in Image Restoration

Document Type : Original Scientific Paper

Authors

‎Department of Applied Mathematics, ‎Faculty of Mathematical Sciences,‎ ‎University of Mazandaran, ‎Babolsar‎, ‎I‎. ‎R‎. ‎Iran

10.22052/mir.2026.257676.1545

Abstract

‎In this paper‎, ‎we propose a novel descent-based hybrid algorithm for solving nonsmooth box-constrained optimization problems‎. ‎The method combines an $\varepsilon$-subdifferential approximation with heuristic local and global line search strategies‎. ‎Theoretical analysis establishes the global convergence‎ ‎of the algorithm‎ ‎under Fritz John optimality conditions‎. ‎To demonstrate the effectiveness of the proposed approach‎, ‎it is applied to several standard grayscale test images for denoising purposes‎, ‎addressing various types of noise‎, ‎including Gaussian and salt-and-pepper noise‎. ‎Moreover‎, ‎extensive experiments and comparative analyses with existing denoising algorithms confirm the superior performance of our method in terms of restoration quality‎, ‎particularly with respect to PSNR and SSIM metrics‎.

Keywords

Main Subjects


[1] M. Gaudioso, G. Giallombardo and G. Miglionico, Essentials of numerical nonsmooth optimization, Ann. Oper. Res. 314 (2022) 213-253, https://doi.org/10.1007/s10479-021-04498-y.
[2] B. Acharjee, M. H. Hanif and O. Waqar, Deep unsupervised learning for optimization with box and monotone matrix based polytope constraints: A case-study of D2D wireless networks, IEEE Wirel. Commun. Lett. 12 (2023) 2223-2227, https://doi.org/10.1109/LWC.2023.3316114.
[3] L. Bottou, F. E. Curtis and J. Nocedal, Optimization methods for large-scale machine learning, SIAM Rev. 60 (2018) 223 -311, https://doi.org/10.1137/16M1080173.
[4] C. Shen, W. Xue, L-H. Zhang and B. Wang, An active-set proximal-Newton algorithm for $\ell_{1}$ regularized optimization problems with box-constraints, J. Sci. Comput. 85 (2020) #57, https://doi.org/10.1007/s10915-020-01364-0.
[5] X. Jia, C. Kanzow, P. Mehlitz and G. Wachsmuth, An augmented Lagrangian method for optimization problems with structured geometric constraints, Math. Program. 199 (2023) 1365-1415, https://doi.org/10.1007/s10107-022-01870-z.
[6] S. Crisci, F. Porta, V. Ruggiero and L. Zanni, Hybrid limited memory gradient projection methods for box-constrained optimization problems, Comput. Optim. Appl. 84 (2023) 151-189, https://doi.org/10.1007/s10589-022-00409-4.
[7] A. Bemporad, An L-BFGS-B approach for linear and nonlinear system identi-cation under $\ell_{1}$ and group-lasso regularization, IEEE Trans. Autom. Control 70 (2025) 4857-4864, https://doi.org/10.1109/TAC.2025.3541018.
[8] A. Neumaier, B. Azmi and M. Kimiaei, An active set method for boundconstrained optimization, Optim. Methods Softw. 39 (2024) 1216-1240, https://doi.org/10.1080/10556788.2024.2339215.
[9] Y. Yang, An efficient arc-search interior-point algorithm for convex quadratic programming with box-constraints, Numer. Algorithms 91 (2022) 711-748, https://doi.org/10.1007/s11075-022-01279-x.
[10] Z. Y. Wu, F. S. Bai and J. Tian, Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials, J. Oper. Res. Soc. China 5 (2017) 193-218, https://doi.org/10.1007/s40305-017-0157-3.
[11] T. Takahashi and C. Batty, Optimizing parameters for static equilibrium of discrete elastic rods with active-set Cholesky, IEEE Trans. Vis. Comput. Graph. 32 (2026) 1951-1962, https://doi.org/10.1109/TVCG.2025.3622483.
[12] W. Cheng, Z. LinPeng and D. Li, An inexact quasi-Newton algorithm for large-scale `1 optimization with box constraints, Appl. Numer. Math. 193 (2023) 179-195, https://doi.org/10.1016/j.apnum.2023.07.004.
[13] L. Bottou, F. E. Curtis and J. Nocedal, Optimization methods for large-scale machine learning, SIAM Rev. 60 (2018) 223 -311.
[14] C. Audet and J. E. Jr. Dennis, Mesh adaptive direct search algorithms for constrained optimization, SIAM J. Optim. 17 (2006) 188-217, https://doi.org/10.1137/040603371.
[15] E. Chouzenoux, M. C. Corbineau and J. C. Pesquet, A proximal interior point algorithm with applications to image processing, J. Math. Imaging Vision 62 (2020) 919-940, https://doi.org/10.1007/s10851-019-00916-w.
[16] T. Tirer and R. Giryes, On the convergence rate of projected gradient descent for a back-projection based objective, SIAM J. Imaging Sci. 14 (2021) 1504-1531, https://doi.org/10.1137/21M1407902.
[17] W. Wang, C. Wu and X. C. Tai, A globally convergent algorithm for a constrained non-Lipschitz image restoration model, J. Sci. Comput. 83 (2020) #14, https://doi.org/10.1007/s10915-020-01190-4.
[18] W. S. Xie, Y. F. Yang and B. Zhou, An ADMM algorithm for second-order TV-based MR image reconstruction, Numer. Algorithms, 67 (2014) 827-843, https://doi.org/10.1007/s11075-014-9826-z.
[19] N. Mahdavi-Amiri and R. Yousefpour, An e ective nonsmooth optimization algorithm for locally Lipschitz functions, J. Optim. Theory Appl. 155 (2012) 180-195, https://doi.org/10.1007/s10957-012-0024-7.
[20] Q. Long, C. Wu, X. Wang and Z. Wu, A modifed quasisecant method for global optimization, Appl. Math. Model. 51 (2017) 21-37.
[21] A. Bagirov, N. Karmitsa and M. M. Makela, Introduction to Nonsmooth Optimization, Theory, Practice and Software, Springer Cham, 2014.
[22] K. Hoseinpour and Z. Akbari, (2025). MATLAB code [Computer software]. GitHub. Available at: https://github.com/kimiahoseinpour/matlab-code.git
[23] A. Weber, Signal and I. P. I. of the University of Southern California, The USCSIPI image database, http://sipi.usc.edu/database/ 8 (1997).
[24] D. P. Kingma and J. Ba, Adam: A method for stochastic optimization, arXiv:1412.6980 (2014).
[25] A. Chambolle, An algorithm for total variation minimization and applications, J. Math. Imaging Vision, 20 (2004) 89- 97, https://doi.org/10.1023/B:JMIV.0000011325.36760.1e.