arXiv · 2611.13668
Proximal point algorithm for interval valued optimization problems with application to lasso problem
Abstract
In this paper, we consider a class of unconstrained interval valued optimization problems and using a suitable scalarization technique, we formulate an associated scalarized optimization problem and establish the relationships between the optimal solution of the scalarized problem and the $LU$-nondominated solution of the considered optimization problem. Based on this framework, we propose a proximal point algorithm and derive the global convergence of the sequence generated by the proposed algorithm along with the sublinear and linear rate of convergence for convex and strongly convex cases, respectively. Finally, we provide suitable numerical experiments along with comparative analysis with an existing method and applicability of the proposed algorithm on an interval valued lasso regression problem, highlighting its potential in machine learning models with uncertain data.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Anurag Jayswal, Sunidhi, Caihong Han. 2026-11-10. Proximal point algorithm for interval valued optimization problems with application to lasso problem. https://searcharxiv.com/abs/2611.13668
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.