Morteza Kimiaei

According to our database, Morteza Kimiaei authored at least 22 papers between 2013 and 2025.

Collaborative distances:

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

2025

MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization.

Morteza Kimiaei, Arnold Neumaier

Math. Program. Comput., September, 2025

Machine Learning Algorithms for Improving Black Box Optimization Solvers.

Morteza Kimiaei, Vyacheslav Kungurtsev

CoRR, September, 2025

Machine Learning Algorithms for Improving Exact Classical Solvers in Mixed Integer Continuous Optimization.

Morteza Kimiaei, Vyacheslav Kungurtsev, Brian Olimba

CoRR, August, 2025

2024

Globally linearly convergent nonlinear conjugate gradients without Wolfe line search.

Arnold Neumaier, Morteza Kimiaei, Behzad Azmi

Numer. Algorithms, December, 2024

An active set method for bound-constrained optimization.

Arnold Neumaier, Behzad Azmi, Morteza Kimiaei

Optim. Methods Softw., November, 2024

Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms.

Andrea Brilli, Morteza Kimiaei, Giampaolo Liuzzi, Stefano Lucidi

J. Optim. Theory Appl., October, 2024

Effective matrix adaptation strategy for noisy derivative-free optimization.

Morteza Kimiaei, Arnold Neumaier

Math. Program. Comput., September, 2024

An improvement of the Goldstein line search.

Arnold Neumaier, Morteza Kimiaei

Optim. Lett., July, 2024

2023

New Subspace Method for Unconstrained Derivative-Free Optimization.

Morteza Kimiaei, Arnold Neumaier, Parvaneh Faramarzi

ACM Trans. Math. Softw., December, 2023

2022

A new limited memory method for unconstrained nonlinear least squares.

Morteza Kimiaei, Arnold Neumaier

Soft Comput., 2022

LMBOPT: a limited memory method for bound-constrained optimization.

Morteza Kimiaei, Arnold Neumaier, Behzad Azmi

Math. Program. Comput., 2022

Efficient unconstrained black box optimization.

Morteza Kimiaei, Arnold Neumaier

Math. Program. Comput., 2022

2019

Impulse noise removal by an adaptive trust-region method.

Morteza Kimiaei, Farzad Rahpeymaii

Soft Comput., 2019

A non-monotone pattern search approach for systems of nonlinear equations.

Keyvan Amini, Morteza Kimiaei, Hassan Khotanlou

Int. J. Comput. Math., 2019

2018

Combining line search and trust-region methods for ℓ1-minimization.

Hamid Esmaeili, Majid Rostami, Morteza Kimiaei

Int. J. Comput. Math., 2018

2016

A trust-region approach with novel filter adaptive radius for system of nonlinear equations.

Morteza Kimiaei, Hamid Esmaeili

Numer. Algorithms, 2016

A trust-region method with improved adaptive radius for systems of nonlinear equations.

Hamid Esmaeili, Morteza Kimiaei

Math. Methods Oper. Res., 2016

Impulse noise removal based on new hybrid conjugate gradient approach.

Morteza Kimiaei, Majid Rostami

Kybernetika, 2016

A limited memory quasi-Newton trust-region method for box constrained optimization.

Farzad Rahpeymaii, Morteza Kimiaei, Alireza Bagheri

J. Comput. Appl. Math., 2016

A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations.

Keyvan Amini, Mushtak A. K. Shiker, Morteza Kimiaei

4OR, 2016

2015

An efficient adaptive trust-region method for systems of nonlinear equations.

Hamid Esmaeili, Morteza Kimiaei

Int. J. Comput. Math., 2015

2013

An effective trust-region-based approach for symmetric nonlinear systems.

Masoud Ahookhosh, Hamid Esmaeili, Morteza Kimiaei

Int. J. Comput. Math., 2013