Projected quasisubgradient method for Hölder continuous quasi-convex multiobjective optimization
Discuss this preprint
Start a discussion What are Sciety discussions?Listed in
This article is not in any list yet, why not save it to one of your lists.Abstract
We propose a projected quasisubgradient method for constrained, nondifferentiable, quasi-convex multiobjective minimization problems. Unlike existing approaches that rely on Lipschitz continuity, our method only requires H\"older continuity of the objective components, thereby covering a broader class of quasi-convex functions. Under these assumptions, we establish convergence of the generated sequence to a Pareto optimal solution and derive a sublinear rate of convergence that explicitly depends on the H\"older parameters, recovering the Lipschitz case as a special instance. The method is simple to implement, robust to nondifferentiability, and theoretically well-defined. Numerical experiments including application on portfolio optimization, electric vehicle charging network optimization and smart grid energy management are provided. Dolan-Moré performance profiles indicate that the proposed method outperforms. Mathematics Subject Classification (2000) 49M37; 49J52; 90C29; 90C30