Searcharxiv⌕ Search

arXiv subjects

Federica Donnini

Publications and source records attributed to Federica Donnini.

3 recordsLinked to original sources

Decision-Weighted Limit Theorems: Less Conservative Robust Optimization

Limit theorems provide a natural way to construct tractable models for optimization under uncertainty. Existing approaches typically apply them to unweighted sums of uncertain parameters and use the resulting bounds to construct uncertainty sets. We show that sharper formulations are obtained by applying limit theorems directly to the uncertain linear expressions in the optimization problem, with the decision variables as weights. For independent random variables with finite variance, the weighted central limit theorem yields a second-order cone constraint with a decision-dependent protection term, and for heavy-tailed random variables governed by stable limit laws, the weighted approach yields power-cone constraints. Using norm duality, we show that, under a condition on the individual bounds, the feasible region of the unweighted formulation is contained in that of the weighted one. In 16,000 knapsack instances with a prescribed violation probability of 5%, the weighted formulation improves the optimal objective value by 20.9% on average, with overall average violation probabilities between 3.45% and 4.95%, whereas those of the unweighted formulation are near zero.

math.OC↗

A heavy-ball type curve search method for smooth convexly constrained optimization

This paper addresses smooth convexly constrained optimization problems where the Euclidean projection onto the feasible set is computationally tractable. Although momentum techniques like Polyak's heavy-ball are known for accelerating optimization algorithms, their use in constrained settings remains limited due to challenges in preserving feasibility and ensuring convergence. We thus propose a heavy-ball-type method that extends to the constrained case a recently introduced curve-search globalization framework. The method attempts a momentum update and performs a curvilinear search to enforce an Armijo-type descent condition: when the momentum step is infeasible or unacceptable, the algorithm smoothly reverts to a feasible descent direction. We prove that the algorithm is well-defined and globally convergent to stationary points; the derivation of these results is nontrivial due to the use of a heavy-ball type direction in a constrained setting, where it may generate infeasible iterates. We discuss the incorporation of further mechanisms into the algorithm, including non-monotone curve search, spectral steplength selection and an adaptive momentum strategy. Numerical experiments on benchmark problems show the method is robust and competitive with the state-of-the-art.

math.OC↗

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches

In this work, we deal with unconstrained nonlinear optimization problems. Specifically, we are interested in methods carrying out updates possibly along directions not of descent, like Polyak's heavy-ball algorithm. Instead of enforcing convergence properties through line searches and modifications of search direction when suitable safeguards are not satisfied, we propose a strategy based on searches along curve paths: a curve search starting from the first tentative update allows to smoothly revert towards a gradient-related direction if a sufficient decrease condition is not met. The resulting algorithm provably possesses global convergence guarantees, even with a nonmonotone decrease condition. While the presented framework is rather general, particularly of interest is the case of parabolic searches; in this case, under reasonable assumptions, the resulting algorithm can be shown to possess optimal worst case complexity bounds for reaching approximate stationarity in nonconvex settings. Practically, we show that the proposed globalization strategy allows to consistently accept (optimal) pure heavy-ball steps in the strongly convex case, while standard globalization approaches would at times negate them before even evaluating the objective function. Preliminary computational experiments also suggest that the proposed framework might be more convenient than classical safeguard based approaches.

math.OC↗