| Publication | Date of Publication | Type |
|---|
Effectively leveraging momentum terms in stochastic line search frameworks for fast optimization of finite-sum problems
Computational Optimization and Applications | 2026-06-11 | Paper |
Correction to: ``On the computation of the efficient frontier in advanced sparse portfolio optimization''
4OR | 2026-05-08 | Paper |
On the computation of the efficient frontier in advanced sparse portfolio optimization
4OR | 2026-05-08 | Paper |
Effective front-descent algorithms with convergence guarantees
SIAM Journal on Optimization | 2026-04-17 | Paper |
Combining gradient information and primitive directions for high-performance bound-constrained mixed-integer optimization
Journal of Global Optimization | 2026-03-31 | Paper |
A globally convergent gradient method with momentum
Computational Optimization and Applications | 2026-02-11 | Paper |
Convergence and complexity guarantees for a wide class of descent algorithms in nonconvex multi-objective optimization
Operations Research Letters | 2025-05-03 | Paper |
Loss-optimal classification trees: a generalized framework and the logistic case
Top | 2024-08-26 | Paper |
On the convergence of inexact alternate minimization in problems with \(\ell_0\) penalties
SN Operations Research Forum | 2024-06-21 | Paper |
Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
Journal of Optimization Theory and Applications | 2024-04-29 | Paper |
Mixed-integer quadratic programming reformulations of multi-task learning models
Mathematics in Engineering | 2024-03-14 | Paper |
A unifying framework for sparsity-constrained optimization
Journal of Optimization Theory and Applications | 2023-11-09 | Paper |
A memetic procedure for global multi-objective optimization
Mathematical Programming Computation | 2023-07-24 | Paper |
Inexact penalty decomposition methods for optimization problems with geometric constraints
Computational Optimization and Applications | 2023-07-24 | Paper |
Pareto front approximation through a multi-objective augmented Lagrangian method
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
Improved front steepest descent for multi-objective optimization
Operations Research Letters | 2023-07-03 | Paper |
A limited memory quasi-Newton approach for multi-objective optimization
Computational Optimization and Applications | 2023-04-28 | Paper |
Improved maximum likelihood estimation of ARMA models
Lobachevskii Journal of Mathematics | 2023-01-04 | Paper |
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
Optimization Methods & Software | 2022-12-20 | Paper |
A study on sequential minimal optimization methods for standard quadratic problems
4OR | 2022-11-17 | Paper |
Improved Maximum Likelihood Estimation of ARMA Models
(available as arXiv preprint) | 2022-01-26 | Paper |
An effective procedure for feature subset selection in logistic regression based on information criteria
Computational Optimization and Applications | 2021-08-09 | Paper |
| A two-level decomposition framework exploiting first and second order information for SVM training problems | 2021-07-09 | Paper |
Convergent inexact penalty decomposition methods for cardinality-constrained problems
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
An alternating augmented Lagrangian method for constrained nonconvex optimization
Optimization Methods & Software | 2020-06-16 | Paper |
On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
Operations Research Letters | 2020-02-10 | Paper |
An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
Computational Optimization and Applications | 2019-12-19 | Paper |
A Globally Convergent Gradient Method with Momentum
(available as arXiv preprint) | N/A | Paper |
