Jinyan Fan

According to our database1, Jinyan Fan authored at least 40 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Global Complexity of a Derivative-Free Levenberg-Marquardt Algorithm via Orthogonal Spherical Smoothing.
J. Sci. Comput., September, 2024

A generalized alternating direction method of multipliers for tensor complementarity problems.
Comput. Optim. Appl., July, 2024

2023
Semidefinite Relaxation Methods for Tensor Absolute Value Equations.
SIAM J. Matrix Anal. Appl., December, 2023

Exploiting Channel Sparsity in Massive MIMO Blind Signal Detection via ℓ2-ℓ1 Optimization Over the Stiefel Manifold.
Proceedings of the 24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2023

2022
Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations.
Comput. Optim. Appl., 2022

2020
Convergence rate of the Levenberg-Marquardt method under Hölderian local error bound.
Optim. Methods Softw., 2020

The maximum tensor complementarity eigenvalues.
Optim. Methods Softw., 2020

Higher-degree tensor eigenvalue complementarity problems.
Comput. Optim. Appl., 2020

2019
A semidefinite method for tensor complementarity problems.
Optim. Methods Softw., 2019

Completely Positive Binary Tensors.
Math. Oper. Res., 2019

An Adaptive Multi-step Levenberg-Marquardt Method.
J. Sci. Comput., 2019

A hierarchy of semidefinite relaxations for completely positive tensor optimization problems.
J. Glob. Optim., 2019

2018
Tensor eigenvalue complementarity problems.
Math. Program., 2018

On a New Updating Rule of the Levenberg-Marquardt Parameter.
J. Sci. Comput., 2018

Tensor maximal correlation problems.
J. Glob. Optim., 2018

Completely positive tensor recovery with minimal nuclear value.
Comput. Optim. Appl., 2018

2017
A semidefinite algorithm for completely positive tensor decomposition.
Comput. Optim. Appl., 2017

2016
The CP-Matrix Approximation Problem.
SIAM J. Matrix Anal. Appl., 2016

Global complexity bound of the Levenberg-Marquardt method.
Optim. Methods Softw., 2016

Computing the distance between the linear matrix pencil and the completely positive cone.
Comput. Optim. Appl., 2016

2015
On the modified trust region algorithm for nonlinear equations.
Optim. Methods Softw., 2015

Interiors of completely positive cones.
J. Glob. Optim., 2015

2014
The CP-Matrix Completion Problem.
SIAM J. Matrix Anal. Appl., 2014

A regularized Newton method for monotone nonlinear equations and its application.
Optim. Methods Softw., 2014

Accelerating the modified Levenberg-Marquardt method for nonlinear equations.
Math. Comput., 2014

2013
A Shamanskii-like Levenberg-Marquardt method for nonlinear equations.
Comput. Optim. Appl., 2013

A Levenberg-Marquardt algorithm with correction for singular system of nonlinear equations.
Appl. Math. Comput., 2013

2012
The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence.
Math. Comput., 2012

Generalized infinitive rough sets based on reflexive relations.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

2011
An improved trust region algorithm for nonlinear equations.
Comput. Optim. Appl., 2011

2010
A modified trust region algorithm for nonlinear equations with new updating rule of trust region radius.
Int. J. Comput. Math., 2010

2009
A note on the Levenberg-Marquardt parameter.
Appl. Math. Comput., 2009

2006
Quadratic programs over the Stiefel manifold.
Oper. Res. Lett., 2006

Convergence Properties of a Self-adaptive Levenberg-Marquardt Algorithm Under Local Error Bound Condition.
Comput. Optim. Appl., 2006

Convergence Rate of The Trust Region Method for Nonlinear Equations Under Local Error Bound Condition.
Comput. Optim. Appl., 2006

2005
On the Quadratic Convergence of the Levenberg-Marquardt Method without Nonsingularity Assumption.
Computing, 2005

Duality theories in nonlinear semidefinite programming.
Appl. Math. Lett., 2005

Generalized separation theorems and the Farkas' lemma.
Appl. Math. Lett., 2005

A derivative-free filter method for solving nonlinear complementarity problems.
Appl. Math. Comput., 2005

2001
The solution set of the mixed ls-tls problem.
Int. J. Comput. Math., 2001


  Loading...