Abstract
AbstractIt is known that many optimization problems can be reformulated as composite optimization problems. In this paper error analyses are provided for two kinds of smoothing approximation methods of a unconstrained composite nondifferentiable optimization problem. Computational results are presented for nondifferentiable optimization problems by using these smoothing approximation methods. Comparisons are made among these methods.
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: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
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.
