Soodeh Habibi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Soodeh Habibi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Varsi
University of Liverpool
3 shared publications - Paul G. Spirakis
University of Liverpool
3 shared publications - Simon Maskell
University of Liverpool
3 shared publications - Efthyvoulos Drousiotis
University of Liverpool
2 shared publications - Michael Stingl
Friedrich-Alexander-Universität Erlangen-Nürnberg
2 shared publications - Michal Kočvara
School of Mathematics, University of Birmingham, Birmingham, UK
2 shared publications
Latest Publications
- 1 May 2026
- Published by Springer Nature
- p. 145-158
Hyperparameter Optimization for Bayesian Decision Trees
- 1 May 2026
- Published by Springer Nature
- p. 145-158
Hyperparameter Optimization for Bayesian Decision Trees
- Open Access
- 1 July 2025
- Published by Springer Nature in Journal of Global Optimization
- p. 1-23
On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate gradient method solving the linear systems. The preconditioner utilizes the low-rank structure of the solution of the relaxations. In order to fully exploit this, we need to re-write the moment relaxations. To treat the arising linear equality constraints we use an $$\ell _1$$ -penalty approach within the interior-point solver. The efficiency of this approach is demonstrated by numerical experiments with the MAXCUT and other randomly generated problems and a comparison with a state-of-the-art semidefinite solver and the ADMM method. We further propose a hybrid ADMM-interior-point method that proves to be efficient for certain problem classes. As a by-product, we observe that the second-order relaxation is often high enough to deliver a globally optimal solution of the original problem.- 1 July 2025
- Published by Springer Nature in Journal of Global Optimization
- p. 1-23
Open AccessOn the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate gradient method solving the linear systems. The preconditioner utilizes the low-rank structure of the solution of the relaxations. In order to fully exploit this, we need to re-write the moment relaxations. To treat the arising linear equality constraints we use an $$\ell _1$$ -penalty approach within the interior-point solver. The efficiency of this approach is demonstrated by numerical experiments with the MAXCUT and other randomly generated problems and a comparison with a state-of-the-art semidefinite solver and the ADMM method. We further propose a hybrid ADMM-interior-point method that proves to be efficient for certain problem classes. As a by-product, we observe that the second-order relaxation is often high enough to deliver a globally optimal solution of the original problem. - 22 June 2025
- Published by Springer Nature
- p. 315-328
Adversarial Attacks on Trees: Size Matters
- 3 January 2025
- Published by Springer Nature
- p. 169-184
Conditional Importance Resampling for an Enhanced Sequential Monte Carlo Sampler
- 3 January 2025
- Published by Springer Nature
- p. 169-184
Conditional Importance Resampling for an Enhanced Sequential Monte Carlo Sampler
- Open Access
On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate gradient method solving the linear systems. The preconditioner utilizes the low-rank structure of the solution of the relaxations. In order to fully exploit this, we need to re-write the moment relaxations. To treat the arising linear equality constraints we use an $\ell_1$-penalty approach within the interior-point solver. The efficiency of this approach is demonstrated by numerical experiments with the MAXCUT and other randomly generated problems and a comparison with a state-of-the-art semidefinite solver and the ADMM method. We further propose a hybrid ADMM-interior-point method that proves to be efficient for certain problem classes. As a by-product, we observe that the second-order relaxation is often high enough to deliver a globally optimal solution of the original problem.
Open AccessOn the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
The aim of this paper is to solve linear semidefinite programs arising from higher-order Lasserre relaxations of unconstrained binary quadratic optimization problems. For this we use an interior point method with a preconditioned conjugate gradient method solving the linear systems. The preconditioner utilizes the low-rank structure of the solution of the relaxations. In order to fully exploit this, we need to re-write the moment relaxations. To treat the arising linear equality constraints we use an $\ell_1$-penalty approach within the interior-point solver. The efficiency of this approach is demonstrated by numerical experiments with the MAXCUT and other randomly generated problems and a comparison with a state-of-the-art semidefinite solver and the ADMM method. We further propose a hybrid ADMM-interior-point method that proves to be efficient for certain problem classes. As a by-product, we observe that the second-order relaxation is often high enough to deliver a globally optimal solution of the original problem.