activity
20142026
most citedA Fast Active Set Block Coordinate Descent Algorithm for -regularized least squares

32 citations · 87 across the 30 of their papers we have counts for

collaborators
Showing 2021Show all

7 papers · 1 filter

math.OC2021

An Improved Penalty Algorithm using Model Order Reduction for MIPDECO problems with partial observations

Dominik Garmatter, Margherita Porcelli, Francesco Rinaldi +1

This work addresses optimal control problems governed by a linear time-dependent partial differential equation (PDE) as well as integer constraints on the control. Moreover, partia…

math.OC2021

Minimization over the l1-ball using an active-set non-monotone projected gradient

Andrea Cristofari, Marianna De Santis, Stefano Lucidi +1

The l1-ball is a nicely structured feasible set that is widely used in many fields (e.g., machine learning, statistics and signal analysis) to enforce some sparsity in the model so…

math.OC2021

Derivative-free methods for mixed-integer nonsmooth constrained optimization

Tommaso Giovannelli, Giampaolo Liuzzi, Stefano Lucidi +1

In this paper, we consider mixed-integer nonsmooth constrained optimization problems whose objective/constraint functions are available only as the output of a black-box zeroth-ord…

math.OC2021

Frank-Wolfe and friends: a journey into projection-free first-order optimization methods

Immanuel. M. Bomze, Francesco Rinaldi, Damiano Zeffiro

Invented some 65 years ago in a seminal paper by Marguerite Straus-Frank and Philip Wolfe, the Frank-Wolfe method recently enjoys a remarkable revival, fuelled by the need of fast…

cs.SI2021★ 2 cited

A Variance-aware Multiobjective Louvain-like Method for Community Detection in Multiplex Networks

Sara Venturini, Andrea Cristofari, Francesco Rinaldi +1

In this paper, we focus on the community detection problem in multiplex networks, i.e., networks with multiple layers having same node sets and no inter-layer connections. In parti…

math.OC2021

A Unifying Framework for Sparsity Constrained Optimization

M. Lapucci, T. Levato, F. Rinaldi +1

In this paper, we consider the optimization problem of minimizing a continuously differentiable function subject to both convex constraints and sparsity constraints. By exploiting…

math.OC2021

Fast cluster detection in networks by first-order optimization

Immanuel M. Bomze, Francesco Rinaldi, Damiano Zeffiro

Cluster detection plays a fundamental role in the analysis of data. In this paper, we focus on the use of s-defective clique models for network-based cluster detection and propose…