4 papers
AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
NataÅ¡a KrejiÄ, NataÅ¡a Krklec JerinkiÄ, Tijana OstojiÄ +1
A class of optimization problems characterized by a weighted finite-sum objective function subject to box constraints is considered. We propose a novel stochastic optimization meth…
Parallel Inexact Levenberg-Marquardt Method for Nearly-Separable Nonlinear Least Squares
Lidija Fodor, Dusan Jakovetic, Natasa Krejic +1
Motivated by localization problems such as cadastral maps refinements, we consider a generic Nonlinear Least Squares (NLS) problem of minimizing an aggregate squared fit across all…
Distributed Inexact Newton Method with Adaptive Step Sizes
Dusan Jakovetic, Natasa Krejic, Greta Malaspina
We consider two formulations for distributed optimization wherein agents in a generic connected network solve a problem of common interest: distributed personalized optimizatio…
SLiSeS: Subsampled Line Search Spectral Gradient Method for Finite Sums
Stefania Bellavia, NataÅ¡a KrejiÄ, NataÅ¡a Krklec JerinkiÄ +1
The spectral gradient method is known to be a powerful low-cost tool for solving large-scale optimization problems. In this paper, our goal is to exploit its advantages in the stoc…