Abstract
We propose an iterative method that solves a nonsmoothconvex optimization problem by converting the originalobjective function to a once continuously differentiablefunction by way of Moreau-Yosida regularization.The proposed method makes use of approximate functionand gradient values of the Moreau-Yosida regularizationinstead of the corresponding exact values.Under this setting, Fukushima and Qi (1996) and Raufand Fukushima (2000) proposed a proximal Newton method anda proximal BFGS method, respectively, for nonsmooth convex optimization.While these methods employ a line search strategyto achieve global convergence, the method proposed in this paperuses a trust region strategy.We establish global and superlinear convergence of the methodunder appropriate assumptions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Industrial & Management Optimization
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
