Marianna De Santis

Orcid: 0000-0002-1189-5917

Affiliations:
  • Sapienza University of Rome, Italy
  • Technical University of Dortmund, Germany (former)


According to our database1, Marianna De Santis authored at least 30 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization.
J. Optim. Theory Appl., October, 2024

An oracle-based framework for robust combinatorial optimization.
J. Glob. Optim., January, 2024

2023
Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization.
CoRR, 2023

2022
On the exactness of the <i>ε</i>-constraint method for biobjective nonlinear integer programming.
Oper. Res. Lett., 2022

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems.
INFORMS J. Comput., 2022

Minimization over the ℓ <sub>1</sub>-ball using an active-set non-monotone projected gradient.
Comput. Optim. Appl., 2022

2021
A decision space algorithm for multiobjective convex quadratic integer optimization.
Comput. Oper. Res., 2021

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.
4OR, 2021

Improving ADMMs for solving doubly nonnegative programs through dual factorization.
4OR, 2021

Design of a wearable device for physiological parameter monitoring in a COVID setting.
Proceedings of the 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2021

2020
Solving Multiobjective Mixed Integer Convex Optimization Problems.
SIAM J. Optim., 2020

Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming.
Eur. J. Oper. Res., 2020

An active-set algorithmic framework for non-convex optimization problems over the simplex.
Comput. Optim. Appl., 2020

2019
An active set algorithm for robust combinatorial optimization based on separation oracles.
Math. Program. Comput., 2019

2018
Using a factored dual in augmented Lagrangian methods for semidefinite programming.
Oper. Res. Lett., 2018

A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization.
J. Glob. Optim., 2018

2017
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization.
J. Optim. Theory Appl., 2017

2016
A Fast Active Set Block Coordinate Descent Algorithm for ℓ<sub>1</sub>-Regularized Least Squares.
SIAM J. Optim., 2016

A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.
SIAM J. Optim., 2016

A nonmonotone GRASP.
Math. Program. Comput., 2016

Dual approaches for a specific class of integer nonlinear programming problems.
Electron. Notes Discret. Math., 2016

2015
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations.
Oper. Res. Lett., 2015

2014
Feasibility Pump-like heuristics for mixed integer problems.
Discret. Appl. Math., 2014

Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes.
Bioinform., 2014

2013
A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach.
SIAM J. Optim., 2013

An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations.
SIAM J. Optim., 2013

2012
Continuous Reformulations for Zero-One Programming Problems.
J. Optim. Theory Appl., 2012

An active set feasible method for large-scale minimization problems with bound constraints.
Comput. Optim. Appl., 2012

2011
Continuous Reformulations for Zero-one Programming Problems.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

A New Feasibility Pump-Like Heuristic for Mixed Integer Problems.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011


  Loading...