Marianna De santis
Title
Cited by
Cited by
Year
A Fast Active Set Block Coordinate Descent Algorithm for -Regularized Least Squares
M De Santis, S Lucidi, F Rinaldi
SIAM Journal on Optimization 26 (1), 781-809, 2016
312016
An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
C Buchheim, M De Santis, L Palagi, M Piacentini
SIAM Journal on Optimization 23 (3), 1867-1889, 2013
292013
A new class of functions for measuring solution integrality in the Feasibility Pump approach
M De Santis, S Lucidi, F Rinaldi
SIAM Journal on Optimization 23 (3), 1575-1606, 2013
22*2013
A feasible active set method with reoptimization for convex quadratic mixed-integer programming
C Buchheim, MD Santis, S Lucidi, F Rinaldi, L Trieu
SIAM Journal on Optimization 26 (3), 1695-1714, 2016
202016
Feasibility pump-like heuristics for mixed integer problems
M De Santis, S Lucidi, F Rinaldi
Discrete Applied Mathematics 165, 152-167, 2014
14*2014
An active set feasible method for large-scale minimization problems with bound constraints
M De Santis, G Di Pillo, S Lucidi
Computational Optimization and Applications 53 (2), 395-423, 2012
142012
A two-stage active-set algorithm for bound-constrained optimization
A Cristofari, M De Santis, S Lucidi, F Rinaldi
Journal of Optimization Theory and Applications 172 (2), 369-401, 2017
132017
An Active-Set Algorithmic Framework for Non-Convex Optimization Problems over the Simplex
A Cristofari, M De Santis, S Lucidi, F Rinaldi
Computational Optimization and Applications 77, 57-89, 2020
9*2020
Solving multiobjective mixed integer convex optimization problems
M De Santis, G Eichfelder, J Niebling, S Rocktäschel
SIAM Journal on Optimization 30 (4), 3122-3145, 2020
62020
A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization
C Buchheim, M De Santis, F Rinaldi, L Trieu
Journal of Global Optimization 70 (3), 625-644, 2018
62018
Continuous reformulations for zero–one programming problems
M De Santis, F Rinaldi
Journal of Optimization Theory and Applications 153 (1), 75-84, 2012
62012
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
C Buchheim, M De Santis, L Palagi
Operations Research Letters 43 (4), 384-388, 2015
52015
Using a factored dual in augmented Lagrangian methods for semidefinite programming
M De Santis, F Rendl, A Wiegele
Operations Research Letters 46 (5), 523-528, 2018
42018
Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes
M De Santis, F Rinaldi, E Falcone, S Lucidi, G Piaggio, A Gurtner, ...
Bioinformatics 30 (2), 228-233, 2014
42014
An active set algorithm for robust combinatorial optimization based on separation oracles
C Buchheim, M De Santis
Mathematical Programming Computation 11 (4), 755-789, 2019
32019
Continuous approaches to mixed integer programming problems
M De Santis
32012
A nonmonotone grasp
M De Santis, P Festa, G Liuzzi, S Lucidi, F Rinaldi
Mathematical Programming Computation 8 (3), 271-309, 2016
22016
A Frank-Wolfe based branch-and-bound algorithm for mixed-integer portfolio optimization
C Buchheim, M De Santis, F Rinaldi, L Trieu
arXiv preprint arXiv:1507.05914, 2015
22015
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming
M De Santis, G Grani, L Palagi
European Journal of Operational Research 283 (1), 57-69, 2020
12020
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
M Conforti, M De Santis, M Di Summa, F Rinaldi
4OR, 1-18, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20