373 citations
- IBM (Ireland)IE50 papers
- University College DublinIE20 papers
- IBM (United States)US11 papers
- IBM Research - Thomas J. Watson Research CenterUS6 papers
- IBM Research - ZurichCH6 papers
- Lehigh UniversityUS6 papers
- Trinity College DublinIE6 papers
- Imperial College LondonGB5 papers
- University of PaduaIT5 papers
- École Polytechnique Fédérale de LausanneCH4 papers
- IBM Research - AlmadenUS4 papers
- Massachusetts Institute of TechnologyUS4 papers
8 papers · 2 filters
Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions
Claudio Gambella, Jakub Marecek, Martin Mevissen
We study the projection onto the set of feasible inputs and the set of feasible solutions of a polynomial optimisation problem (POP). Our motivation is increasing the robustness of…
A Fine-Grained Variant of the Hierarchy of Lasserre
Wann-Jiun Ma, Jakub Marecek, Martin Mevissen
There has been much recent interest in hierarchies of progressively stronger convexifications of polynomial optimisation problems (POP). These often converge to the global optimum…
Personalized Optimization with User's Feedback
Andrea Simonetto, Emiliano Dall'Anese, Julien Monteil +1
This paper develops an online algorithm to solve a time-varying optimization problem with an objective that comprises a known time-varying cost and an unknown function. This proble…
Prediction-Correction Splittings for Nonsmooth Time-Varying Optimization
Nicola Bastianello, Andrea Simonetto, Ruggero Carli
We address the solution of time-varying optimization problems characterized by the sum of a time-varying strongly convex function and a time-invariant nonsmooth convex function. We…
Real-time City-scale Ridesharing via Linear Assignment Problems
Andrea Simonetto, Julien Monteil, Claudio Gambella
In this paper, we propose a novel, computational efficient, dynamic ridesharing algorithm. The beneficial computational properties of the algorithm arise from casting the rideshari…
Prediction-Correction for Nonsmooth Time-Varying Optimization via Forward-Backward Envelopes
Nicola Bastianello, Andrea Simonetto, Ruggero Carli
We present an algorithm for minimizing the sum of a strongly convex time-varying function with a time-invariant, convex, and nonsmooth function. The proposed algorithm employs the…