Abstract
In this paper, a steepest descent method is developed for the robust counterpart of uncertain multiobjective optimization problems under finite uncertainty. The robust counterpart under consideration is the minimum of objective wise worst case, which is a nonsmooth deterministic multiobjective optimization problem. To solve this robust counterpart with the help of the steepest descent method, a subproblem is constructed and solved to find a descent direction. An Armijo-type inexact line search technique is employed to find a suitable step length. With the help of the descent direction and step length, a sequence is generated. The convergence of the proposed method is justified under some common assumptions. Finally, the algorithm is verified and compared with one existing method with the help of some numerical problems.
Published Version
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.
