Abstract

We address conditions for global convergence and worst-case complexity bounds of descent algorithms in nonconvex multi-objective optimization. Specifically, we define the concept of steepest-descent-related directions. We consider iterative algorithms taking steps along such directions, selecting the stepsize according to a standard Armijo-type rule. We prove that methods fitting this framework automatically enjoy global convergence properties. Moreover, we show that a slightly stricter property, satisfied by most known algorithms, guarantees the same complexity bound of O(ϵ−2) as the steepest descent method.

Full Text
Paper version not known

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 call

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.