Marianna De Santis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Marianna De Santis has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Stefano Lucidi
Sapienza University of Rome, Rome, Italy
10 shared publications - Francesco Rinaldi
Dipartimento di Matematica "Tullio Levi-Civita" Università di Padova Italy
8 shared publications - Andrea Cristofari
Department of Civil Engineering and Computer Science Engineering University of Rome "Tor Vergata" Via del Politecnico 1 00133 Rome Italy
7 shared publications - Angelika Wiegele
Alpen-Adria-Universität Klagenfurt
4 shared publications - Christoph Buchheim
Fakultät für Mathematik, Technische Universität Dortmund, Dortmund, Germany
3 shared publications - Gabriele Eichfelder
Institute of Mathematics, Technische Universität Ilmenau, Ilmenau, Germany
3 shared publications
Latest Publications
- Open Access
- 5 November 2026
- Published by Elsevier in International Journal of Production Economics
- Vol. 304
The Best Allocation Resource Size (BARS) problem: a bi-objective integer programming model to balance cost and complexity in resource selection
- 5 November 2026
- Published by Elsevier in International Journal of Production Economics
- Vol. 304
Open AccessThe Best Allocation Resource Size (BARS) problem: a bi-objective integer programming model to balance cost and complexity in resource selection
- Open Access
- 1 August 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 95 (1) , 1-28
Objective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm
We propose an Adagrad-like algorithm for multi-objective unconstrained optimization that relies on the computation of a common descent direction only. Unlike classical local algorithms for multi-objective optimization, our approach does not rely on the dominance property to accept new iterates, which allows for a flexible and function-free optimization framework. New points are obtained using an adaptive stepsize that does not require neither knowledge of Lipschitz constants nor the use of line search procedures. The rate of convergence is analyzed and is shown to be $$\mathcal {O}(1 / \sqrt{ k+1})$$ with respect to the norm of the common descent direction. The method is extensively validated on a broad class of unconstrained multi-objective problems and simple multi-task learning instances, and compared against a first-order line search algorithm. Additionally, we present a preliminary study of the behavior under noisy multi-objective settings, highlighting the robustness of the method.- 1 August 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 95 (1) , 1-28
Open AccessObjective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm
We propose an Adagrad-like algorithm for multi-objective unconstrained optimization that relies on the computation of a common descent direction only. Unlike classical local algorithms for multi-objective optimization, our approach does not rely on the dominance property to accept new iterates, which allows for a flexible and function-free optimization framework. New points are obtained using an adaptive stepsize that does not require neither knowledge of Lipschitz constants nor the use of line search procedures. The rate of convergence is analyzed and is shown to be $$\mathcal {O}(1 / \sqrt{ k+1})$$ with respect to the norm of the common descent direction. The method is extensively validated on a broad class of unconstrained multi-objective problems and simple multi-task learning instances, and compared against a first-order line search algorithm. Additionally, we present a preliminary study of the behavior under noisy multi-objective settings, highlighting the robustness of the method. - Open Access
Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
We propose an Adagrad-like algorithm for multi-objective unconstrained optimization that relies on the computation of a common descent direction only. Unlike classical local algorithms for multi-objective optimization, our approach does not rely on the dominance property to accept new iterates, which allows for a flexible and function-free optimization framework. New points are obtained using an adaptive stepsize that does not require neither knowledge of Lipschitz constants nor the use of line search procedures. The rate of convergence is analyzed and is shown to be $\mathcal{O}(1 / \sqrt{ k+1})$ with respect to the norm of the common descent direction. The method is extensively validated on a broad class of unconstrained multi-objective problems and simple multi-task learning instances, and compared against a first-order line search algorithm. Additionally, we present a preliminary study of the behavior under noisy multi-objective settings, highlighting the robustness of the method.Open AccessObjective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
We propose an Adagrad-like algorithm for multi-objective unconstrained optimization that relies on the computation of a common descent direction only. Unlike classical local algorithms for multi-objective optimization, our approach does not rely on the dominance property to accept new iterates, which allows for a flexible and function-free optimization framework. New points are obtained using an adaptive stepsize that does not require neither knowledge of Lipschitz constants nor the use of line search procedures. The rate of convergence is analyzed and is shown to be $\mathcal{O}(1 / \sqrt{ k+1})$ with respect to the norm of the common descent direction. The method is extensively validated on a broad class of unconstrained multi-objective problems and simple multi-task learning instances, and compared against a first-order line search algorithm. Additionally, we present a preliminary study of the behavior under noisy multi-objective settings, highlighting the robustness of the method. - 9 January 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (3) , 667-698
Quadratic convex reformulations for multiObjective binary quadratic programming
- 9 January 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 94 (3) , 667-698
Quadratic convex reformulations for multiObjective binary quadratic programming
- Open Access
- 15 October 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (3) , 703-721
Designing sustainable diet plans by solving triobjective integer programs
We present an algorithm for triobjective nonlinear integer programs that combines the $$\varepsilon $$ -constrained method with available oracles for biobjective integer programs. We prove that our method is able to detect the nondominated set within a finite number of iterations. Specific strategies to avoid the detection of weakly nondominated points are devised. The method is then used to determine the nondominated solutions of triobjective 0–1 models, built to design nutritionally adequate and healthy diet plans, minimizing their environmental impact. The diet plans refer to menus for school cafeterias and we consider the carbon, water and nitrogen footprints as conflicting objectives to be minimized. Energy and nutrient contents are constrained in suitable ranges suggested by the dietary recommendation of health authorities. Results obtained on two models and on real world data are reported and discussed.- 15 October 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 100 (3) , 703-721
Open AccessDesigning sustainable diet plans by solving triobjective integer programs
We present an algorithm for triobjective nonlinear integer programs that combines the $$\varepsilon $$ -constrained method with available oracles for biobjective integer programs. We prove that our method is able to detect the nondominated set within a finite number of iterations. Specific strategies to avoid the detection of weakly nondominated points are devised. The method is then used to determine the nondominated solutions of triobjective 0–1 models, built to design nutritionally adequate and healthy diet plans, minimizing their environmental impact. The diet plans refer to menus for school cafeterias and we consider the carbon, water and nitrogen footprints as conflicting objectives to be minimized. Energy and nutrient contents are constrained in suitable ranges suggested by the dietary recommendation of health authorities. Results obtained on two models and on real world data are reported and discussed. - Open Access
- 10 October 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 92 (1) , 159-186
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set. The method relies on outer approximations of the upper image set of continuous relaxations. These outer approximations are obtained addressing the dual formulations of specific subproblems where the values of certain integer variables are fixed. The devised pruning conditions and a tailored preprocessing phase allow a fast enumeration of the nodes. Despite we do not require any boundedness of the feasible set, we are able to prove that the method stops after having explored a finite number of nodes. Numerical experiments on a broad set of instances with two, three, and four objectives are presented.
- 10 October 2024
- Published by Springer Nature in Journal of Global Optimization
- Vol. 92 (1) , 159-186
Open AccessUsing dual relaxations in multiobjective mixed-integer convex quadratic programming
We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set. The method relies on outer approximations of the upper image set of continuous relaxations. These outer approximations are obtained addressing the dual formulations of specific subproblems where the values of certain integer variables are fixed. The devised pruning conditions and a tailored preprocessing phase allow a fast enumeration of the nodes. Despite we do not require any boundedness of the feasible set, we are able to prove that the method stops after having explored a finite number of nodes. Numerical experiments on a broad set of instances with two, three, and four objectives are presented.
- Open Access
- 3 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 126-145
On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization
Taking inspiration from what is commonly done in single-objective optimization, most local algorithms proposed for multiobjective optimization extend the classical iterative scalar methods and produce sequences of points able to converge to single efficient points. Recently, a growing number of local algorithms that build sequences of sets has been devised, following the real nature of multiobjective optimization, where the aim is that of approximating the efficient set. This calls for a new analysis of the necessary optimality conditions for multiobjective optimization. We explore conditions for sets of points that share the same features of the necessary optimality conditions for single-objective optimization. On the one hand, from a theoretical point of view, these conditions define properties that are necessarily satisfied by the (weakly) efficient set. On the other hand, from an algorithmic point of view, any set that does not satisfy the proposed conditions can be easily improved by using first-order information on some objective functions. We analyse both the unconstrained and the constrained case, giving some examples.
- 3 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 126-145
Open AccessOn Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization
Taking inspiration from what is commonly done in single-objective optimization, most local algorithms proposed for multiobjective optimization extend the classical iterative scalar methods and produce sequences of points able to converge to single efficient points. Recently, a growing number of local algorithms that build sequences of sets has been devised, following the real nature of multiobjective optimization, where the aim is that of approximating the efficient set. This calls for a new analysis of the necessary optimality conditions for multiobjective optimization. We explore conditions for sets of points that share the same features of the necessary optimality conditions for single-objective optimization. On the one hand, from a theoretical point of view, these conditions define properties that are necessarily satisfied by the (weakly) efficient set. On the other hand, from an algorithmic point of view, any set that does not satisfy the proposed conditions can be easily improved by using first-order information on some objective functions. We analyse both the unconstrained and the constrained case, giving some examples.
- 25 April 2024
- Published by Springer Nature in 4OR
- Vol. 23 (1) , 65-95
Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems
- 25 April 2024
- Published by Springer Nature in 4OR
- Vol. 23 (1) , 65-95
Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems
- Open Access
- 27 May 2023
- Published by MDPI AG in Brain Sciences
- Vol. 13 (6) , 866
Machine Learning-Based Classification to Disentangle EEG Responses to TMS and Auditory Input
The combination of transcranial magnetic stimulation (TMS) and electroencephalography (EEG) offers an unparalleled opportunity to study cortical physiology by characterizing brain electrical responses to external perturbation, called transcranial-evoked potentials (TEPs). Although these reflect cortical post-synaptic potentials, they can be contaminated by auditory evoked potentials (AEPs) due to the TMS click, which partly show a similar spatial and temporal scalp distribution. Therefore, TEPs and AEPs can be difficult to disentangle by common statistical methods, especially in conditions of suboptimal AEP suppression. In this work, we explored the ability of machine learning algorithms to distinguish TEPs recorded with masking of the TMS click, AEPs and non-masked TEPs in a sample of healthy subjects. Overall, our classifier provided reliable results at the single-subject level, even for signals where differences were not shown in previous works. Classification accuracy (CA) was lower at the group level, when different subjects were used for training and test phases, and when three stimulation conditions instead of two were compared. Lastly, CA was higher when average, rather than single-trial TEPs, were used. In conclusion, this proof-of-concept study proposes machine learning as a promising tool to separate pure TEPs from those contaminated by sensory input.
- 27 May 2023
- Published by MDPI AG in Brain Sciences
- Vol. 13 (6) , 866
Open AccessMachine Learning-Based Classification to Disentangle EEG Responses to TMS and Auditory Input
The combination of transcranial magnetic stimulation (TMS) and electroencephalography (EEG) offers an unparalleled opportunity to study cortical physiology by characterizing brain electrical responses to external perturbation, called transcranial-evoked potentials (TEPs). Although these reflect cortical post-synaptic potentials, they can be contaminated by auditory evoked potentials (AEPs) due to the TMS click, which partly show a similar spatial and temporal scalp distribution. Therefore, TEPs and AEPs can be difficult to disentangle by common statistical methods, especially in conditions of suboptimal AEP suppression. In this work, we explored the ability of machine learning algorithms to distinguish TEPs recorded with masking of the TMS click, AEPs and non-masked TEPs in a sample of healthy subjects. Overall, our classifier provided reliable results at the single-subject level, even for signals where differences were not shown in previous works. Classification accuracy (CA) was lower at the group level, when different subjects were used for training and test phases, and when three stimulation conditions instead of two were compared. Lastly, CA was higher when average, rather than single-trial TEPs, were used. In conclusion, this proof-of-concept study proposes machine learning as a promising tool to separate pure TEPs from those contaminated by sensory input.
- Open Access
- 25 January 2023
- Published by Springer Nature in Journal of Global Optimization
- Vol. 88 (1) , 27-51
An oracle-based framework for robust combinatorial optimization
We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario case, but our approach can be extended to other types of uncertainty sets such as polytopes or ellipsoids. Concerning the underlying certain problem, the algorithm is entirely oracle-based, i.e., our approach only requires a (primal) algorithm for solving the certain problem. It is thus particularly useful in case the certain problem is well-studied but its combinatorial structure cannot be directly exploited in a tailored robust optimization approach, or in situations where the underlying problem is only defined implicitly by a given software. The idea of our algorithm is to solve the convex relaxation of the robust problem by a simplicial decomposition approach, the main challenge being the non-differentiability of the objective function in the case of discrete or polytopal uncertainty. The resulting dual bounds are then used within a tailored branch-and-bound framework for solving the robust problem to optimality. By a computational evaluation, we show that our method outperforms straightforward linearization approaches on the robust minimum spanning tree problem. Moreover, using the Concorde solver for the certain oracle, our approach computes much better dual bounds for the robust traveling salesman problem in the same amount of time.
- 25 January 2023
- Published by Springer Nature in Journal of Global Optimization
- Vol. 88 (1) , 27-51
Open AccessAn oracle-based framework for robust combinatorial optimization
We propose a general solution approach for min-max-robust counterparts of combinatorial optimization problems with uncertain linear objectives. We focus on the discrete scenario case, but our approach can be extended to other types of uncertainty sets such as polytopes or ellipsoids. Concerning the underlying certain problem, the algorithm is entirely oracle-based, i.e., our approach only requires a (primal) algorithm for solving the certain problem. It is thus particularly useful in case the certain problem is well-studied but its combinatorial structure cannot be directly exploited in a tailored robust optimization approach, or in situations where the underlying problem is only defined implicitly by a given software. The idea of our algorithm is to solve the convex relaxation of the robust problem by a simplicial decomposition approach, the main challenge being the non-differentiability of the objective function in the case of discrete or polytopal uncertainty. The resulting dual bounds are then used within a tailored branch-and-bound framework for solving the robust problem to optimality. By a computational evaluation, we show that our method outperforms straightforward linearization approaches on the robust minimum spanning tree problem. Moreover, using the Concorde solver for the certain oracle, our approach computes much better dual bounds for the robust traveling salesman problem in the same amount of time.