Oracle complexity of single-loop switching subgradient methods for non-smooth weakly convex functional constrained optimization
We consider a non-convex constrained optimization problem, where the objective function is
weakly convex and the constraint function is either convex or weakly convex. To solve this …
weakly convex and the constraint function is either convex or weakly convex. To solve this …
Distributed online constrained nonconvex optimization in dynamic environments over directed graphs
W Suo, W Li, Y Liu, J Song - Signal Processing, 2025 - Elsevier
This paper is concerned with distributed online constrained nonconvex optimization
problems of minimizing a global cost function decomposed by a sum of local smooth …
problems of minimizing a global cost function decomposed by a sum of local smooth …
Constrained Optimization Techniques for Machine Learning Under Error Bound Conditions
Y Huang - 2024 - search.proquest.com
The recent studies and innovations in the topic of machine learning (ML) demonstrates the
capabilities of ML to analyze data, make predictions, and so on. To facilitate decisions …
capabilities of ML to analyze data, make predictions, and so on. To facilitate decisions …