Papers › Penalty decomposition derivative free method for the minimization of partially...
Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
Francesco Cecere, Matteo Lapucci, Davide Pucci, Marco Sciandrone
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we consider the problem of minimizing a smooth function, given as finite sum of black-box functions, over a convex set. In order to advantageously exploit the structure of the problem, for instance when the terms of the objective functions are partially separable, noisy, costly or with first-order information partially accessible, we propose a framework where the penalty decomposition approach is combined with a derivative-free line-search-based method. Under standard assumptions, we state theoretical results showing that the proposed algorithm is well-defined and globally convergent to stationary points. The results of preliminary numerical experiments, performed on test problems with number of variables up to thousands, show the validity of the proposed method w.r.t. state of the art methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections