We stand with Ukraine

We stand with Ukraine

Yi-Fen Ke

Orcid: 0000-0002-0767-7722

According to our database¹, Yi-Fen Ke authored at least 19 papers between 2014 and 2025.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of five.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

Fractional order calculus enhanced dung beetle optimizer for function global optimization and multilevel threshold medical image segmentation.

[BibT_eX]

[DOI]

,

,

,

J. Supercomput., January, 2025

Color image restoration based on reduced biquaternion matrix singular value decomposition.

[BibT_eX]

[DOI]

,

,

J. Comput. Appl. Math., 2025

2024

Krylov subspace methods based quaternion tensor form for generalized Sylvester quaternion tensor equation with application to color video restoration.

[BibT_eX]

[DOI]

,

,

,

,

J. Frankl. Inst., 2024

2023

Quasi Non-Negative Quaternion Matrix Factorization with Application to Color Face Recognition.

[BibT_eX]

[DOI]

,

,

,

,

J. Sci. Comput., May, 2023

2022

On SOR-like iteration methods for solving weakly nonlinear systems.

[BibT_eX]

[DOI]

,

Optim. Methods Softw., 2022

Generalized conjugate direction algorithm for solving generalized coupled Sylvester transpose matrix equations over reflexive or anti-reflexive matrices.

[BibT_eX]

[DOI]

,

,

J. Frankl. Inst., 2022

Adaptive parameter based matrix splitting iteration method for the large and sparse linear systems.

[BibT_eX]

[DOI]

,

Comput. Math. Appl., 2022

2021

Neural network approaches based on new NCP-functions for solving tensor complementarity problem.

[BibT_eX]

[DOI]

,

J. Appl. Math. Comput., October, 2021

Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems.

[BibT_eX]

[DOI]

Numer. Algorithms, 2021

A modified LM algorithm for tensor complementarity problems over the circular cone.

[BibT_eX]

[DOI]

,

,

J. Comput. Appl. Math., 2021

2020

The new iteration algorithm for absolute value equation.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2020

2018

The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems.

[BibT_eX]

[DOI]

,

,

Numer. Algorithms, 2018

Some preconditioners for elliptic PDE-constrained optimization problems.

[BibT_eX]

[DOI]

,

Comput. Math. Appl., 2018

2017

An inexact modified relaxed splitting preconditioner for the generalized saddle point problems from the incompressible Navier-Stokes equations.

[BibT_eX]

[DOI]

,

Numer. Algorithms, 2017

SOR-like iteration method for solving absolute value equations.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2017

The dimensional splitting iteration methods for solving saddle point problems arising from time-harmonic eddy current models.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2017

2015

Alternating direction method for generalized Sylvester matrix equation AXB + CYD = E.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2015

2014

A preconditioned nested splitting conjugate gradient iterative method for the large sparse generalized Sylvester equation.

[BibT_eX]

[DOI]

,

Comput. Math. Appl., 2014

On the convergence analysis of two-step modulus-based matrix splitting iteration method for linear complementarity problems.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2014

Loading...