Abstract
We discuss a subgradient projection method for dealing with the nonconvex nonsmooth multiobjective optimization problem when every component of the vector-valued function is strongly quasiconvex in the sense of Polyak [Existence theorems and convergence of minimizing sequences in extremum problems with restrictions. Soviet Math. 1966;7:72–75]. Under mild assumptions, we ensure that the generated sequence converges to an efficient solution point of the multiobjective optimization problem and we provide a kind of linear convergence rate. The algorithm is based on a specific generalized subdifferential that was recently introduced for strongly quasiconvex functions, this approach provides new and valuable information on the generated sequence and its convergent point. Finally, we present numerical experiments for classes of quadratic fractional programming problems.
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 callSimilar Papers
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.
