Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
September 17, 2025Mathematical Modelling and AnalysisOpen Access

A partially derivative-free cyclic block coordinate descent method for nonseparable composite optimization

View Full Paper
Ask AI
Bookmark
Share

Authors

VAVitaliano Amaral

Discussion

Loading...

Member takes

Overview

New coordinate descent method enhances composite optimization, demonstrating improved efficiency without derivatives.

Key Points

  • The proposed method improves efficiency in composite optimization problems without requiring derivatives, offering increased flexibility.
  • Our analysis shows that the new coordinate descent method achieves a notable worst-case complexity under general settings.
  • This approach leverages the Lipschitz–Hölder composition and is specifically tailored for convex functions in optimization.
  • Empirical examples highlight the algorithm's practical effectiveness compared to traditional methods, emphasizing its utility.

Cite This Study

Vitaliano Amaral (2025) studied this question.

synapsesocial.com/papers/68d4605131b076d99fa5facchttps://doi.org/10.3846/mma.2025.23064
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization2024
  2. 2Parallel block coordinate descent methods with identification strategies2026
  3. 3A novel proximal gradient method for multiobjective optimization with applications2026
  4. 4Local properties and augmented Lagrangians in fully nonconvex composite optimization2024 · 3 citations
  5. 5The Proximal Gradient Method for Composite Optimization Problems on Riemannian Manifolds2024 · 1 citations