Saeid Ansary Karbasy

According to our database, Saeid Ansary Karbasy authored at least 5 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2025

Improved Branch and Bound algorithm and an interpolation-based search algorithm for quadratic minimization with one negative eigenvalue.

Maziar Salahi, Saeid Ansary Karbasy, Temadher Alassiry Al-Maadeed, Abdelouahed Hamdi

Optim. Lett., April, 2025

2022

On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints.

Temadher Alassiry Al-Maadeed, Saeid Ansary Karbasy, Maziar Salahi, Abdelouahed Hamdi

J. Optim. Theory Appl., 2022

On the branch and bound algorithm for the extended trust-region subproblem.

Saeid Ansary Karbasy, Maziar Salahi

J. Glob. Optim., 2022

2021

An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints.

Saeid Ansary Karbasy, Abdelouahed Hamdi, Maziar Salahi, Akram Taati

Optim. Lett., 2021

2019

A hybrid algorithm for the two-trust-region subproblem.

Saeid Ansary Karbasy, Maziar Salahi

Comput. Appl. Math., 2019