Proximal Subgradient Algorithm for Constrained Multiobjective DC-type Optimization

Research Paper#Optimization, Multiobjective Optimization, Non-convex Optimization, Algorithms🔬 Research|Analyzed: Jan 3, 2026 08:46
Published: Dec 31, 2025 08:31
1 min read
ArXiv

Analysis

This paper addresses a challenging class of multiobjective optimization problems involving non-smooth and non-convex objective functions. The authors propose a proximal subgradient algorithm and prove its convergence to stationary solutions under mild assumptions. This is significant because it provides a practical method for solving a complex class of optimization problems that arise in various applications.
Reference / Citation
View Original
"Under mild assumptions, the sequence generated by the proposed algorithm is bounded and each of its cluster points is a stationary solution."
A
ArXivDec 31, 2025 08:31
* Cited for critical analysis under Article 32.