Keyvan Amini
Orcid: 0000-0002-9264-3091
According to our database1,
Keyvan Amini
authored at least 25 papers
between 2006 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Effective nonmonotone trust region method based on a simple cubic model for unconstrained optimization problems.
J. Appl. Math. Comput., February, 2025
2024
A new structured spectral conjugate gradient method for nonlinear least squares problems.
Numer. Algorithms, October, 2024
2023
Int. J. Comput. Math., February, 2023
Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems.
J. Comput. Appl. Math., 2023
2021
2020
An efficient two-step trust-region algorithm for exactly determined consistent systems of nonlinear equations.
J. Comput. Appl. Math., 2020
2019
Optim. Methods Softw., 2019
J. Optim. Theory Appl., 2019
Int. J. Comput. Math., 2019
2017
2016
Three-steps modified Levenberg-Marquardt method with a new line search for systems of nonlinear equations.
J. Comput. Appl. Math., 2016
A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations.
4OR, 2016
2015
A double-projection-based algorithm for large-scale nonlinear systems of monotone equations.
Numer. Algorithms, 2015
A new line search strategy for finding separating hyperplane in projection-based methods.
Numer. Algorithms, 2015
J. Comput. Appl. Math., 2015
2014
An inexact line search approach using modified nonmonotone strategy for unconstrained optimization.
Numer. Algorithms, 2014
2013
Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations.
Numer. Algorithms, 2013
2012
Numer. Algorithms, 2012
2011
Combination Adaptive Trust Region Method by Non-Monotone Strategy for unconstrained nonlinear Programming.
Asia Pac. J. Oper. Res., 2011
2010
J. Comput. Appl. Math., 2010
A Nonmonotone trust region method with adaptive radius for unconstrained optimization problems.
Comput. Math. Appl., 2010
2009
Exploring complexity of large update interior-point methods for P<sub>*</sub>(kappa) linear complementarity problem based on Kernel function.
Appl. Math. Comput., 2009
2007
Appl. Math. Comput., 2007
2006
Optim. Methods Softw., 2006
Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function.
Appl. Math. Comput., 2006