Abstract
Recently, a new type of optimization problems, the so-called interval optimization problems on Hadamard manifolds, is introduced by the authors in Nguyen et al. [Interval optimization problems on Hadamard manifolds. J Nonlinear Convex Anal. 2023;24(11):2489–2511]. In this follow-up, we further offer the algorithmic bricks for these problems. More specifically, we characterize the optimality and KKT conditions for the interval valued optimization problems on Hadamard manifolds. For unconstrained problems, the existence of efficient points and the steepest descent algorithm are investigated. To the contrast, the KKT conditions and exact penalty approach are explored in the ones involving inequality constraints. These results pave the foundations for the solvability of interval valued optimization problems on Hadamard manifolds.
Sign-in/Register to access full text options 
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.
