Abstract
We give efficiency estimates for proximal bundle methods for finding f*≔minXf, where f and X are convex. We show that, for any accuracy ∈<0, these methods find a point xk∈X such that f(xk)−f*≤∈ after at most k=O(1/∈3) objective and subgradient evaluations.
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 callDisclaimer: 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.
