Gonglin Yuan

Orcid: 0000-0002-0998-8807

According to our database1, Gonglin Yuan authored at least 54 papers between 2004 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Particle Swarm Optimization for Efficiently Evolving Deep Convolutional Neural Networks Using an Autoencoder-Based Encoding Strategy.
IEEE Trans. Evol. Comput., October, 2024

Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds.
J. Glob. Optim., August, 2024

Stochastic three-term conjugate gradient method with variance technique for non-convex learning.
Stat. Comput., June, 2024

An adaptive projection BFGS method for nonconvex unconstrained optimization problems.
Numer. Algorithms, April, 2024

Biased stochastic conjugate gradient algorithm with adaptive step size for nonconvex problems.
Expert Syst. Appl., March, 2024

An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems.
J. Comput. Appl. Math., February, 2024

Fast Optimization of Charged Particle Dynamics with Damping.
SIAM J. Optim., 2024

vEpiNet: A multimodal interictal epileptiform discharge detection method based on video and electroencephalogram data.
Neural Networks, 2024

A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems.
J. Comput. Appl. Math., 2024

An evolutionary neural architecture search method based on performance prediction and weight inheritance.
Inf. Sci., 2024

2023
A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems.
Numer. Algorithms, July, 2023

Infeasibility of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state.
CoRR, 2023

An Effective One-Shot Neural Architecture Search Method with Supernet Fine-Tuning for Image Classification.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

2022
A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions.
J. Appl. Math. Comput., December, 2022

Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization.
Comput. Appl. Math., September, 2022

A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems.
J. Appl. Math. Comput., April, 2022

of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state.
Quantum Inf. Comput., 2022

A conjugate gradient algorithm based on double parameter scaled Broyden-Fletcher-Goldfarb-Shanno update for optimization problems and image restoration.
Neural Comput. Appl., 2022

Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions.
Numer. Algorithms, 2022

The global convergence of the BFGS method with a modified WWP line search for nonconvex functions.
Numer. Algorithms, 2022

Adaptive scaling damped BFGS method without gradient Lipschitz continuity.
Appl. Math. Lett., 2022

2021
The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems.
Soft Comput., 2021

Stochastic Bigger Subspace Algorithms for Nonconvex Stochastic Optimization.
IEEE Access, 2021

A Two-Stage Efficient Evolutionary Neural Architecture Search Method for Image Classification.
Proceedings of the PRICAI 2021: Trends in Artificial Intelligence, 2021

2020
Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions.
Numer. Algorithms, 2020

The Projection Technique for Two Open Problems of Unconstrained Optimization Problems.
J. Optim. Theory Appl., 2020

A Graph-Based Approach to Automatic Convolutional Neural Network Construction for Image Classification.
Proceedings of the 35th International Conference on Image and Vision Computing New Zealand, 2020

2019
The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions.
J. Comput. Appl. Math., 2019

Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor.
J. Comput. Appl. Math., 2019

The Hager-Zhang conjugate gradient algorithm for large-scale nonlinear equations.
Int. J. Comput. Math., 2019

2018
The global convergence of a modified BFGS method for nonconvex functions.
J. Comput. Appl. Math., 2018

An effective adaptive trust region algorithm for nonsmooth minimization.
Comput. Optim. Appl., 2018

A Modified Dai-Yuan Conjugate Gradient Algorithm for Large-Scale Optimization Problems.
Proceedings of the Cloud Computing and Security - 4th International Conference, 2018

A Modified Wei-Yao-Liu Conjugate Gradient Algorithm for Two Type Minimization Optimization Models.
Proceedings of the Cloud Computing and Security - 4th International Conference, 2018

2017
A Conjugate Gradient Algorithm with Yuan-Wei-Lu Line Search.
Proceedings of the Cloud Computing and Security - Third International Conference, 2017

2016
A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations.
J. Optim. Theory Appl., 2016

New Conjugate Gradient Algorithms Based on New Conjugacy Condition.
Proceedings of the Cloud Computing and Security - Second International Conference, 2016

2015
An active-set projected trust region algorithm for box constrained optimization problems.
J. Syst. Sci. Complex., 2015

A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations.
J. Comput. Appl. Math., 2015

2014
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs.
J. Comput. Appl. Math., 2014

2013
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization.
Comput. Optim. Appl., 2013

2011
Limited memory BFGS method with backtracking for symmetric nonlinear equations.
Math. Comput. Model., 2011

A new trust-region method with line search for solving symmetric nonlinear equations.
Int. J. Comput. Math., 2011

A BFGS trust-region method for nonlinear equations.
Computing, 2011

2010
A Line Search Algorithm for Unconstrained Optimization.
J. Softw. Eng. Appl., 2010

Convergence analysis of a modified BFGS method on convex minimizations.
Comput. Optim. Appl., 2010

2009
Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems.
Optim. Lett., 2009

A conjugate gradient method with descent direction for unconstrained optimization.
J. Comput. Appl. Math., 2009

A Conjugate Gradient Method for Unconstrained Optimization Problems.
Int. J. Math. Math. Sci., 2009

A Rank-One Fitting Method with Descent Direction for Solving Symmetric Nonlinear Equations.
Int. J. Commun. Netw. Syst. Sci., 2009

A modified PRP conjugate gradient method.
Ann. Oper. Res., 2009

A Trust-Region-Based BFGS Method with Line Search Technique for Symmetric Nonlinear Equations.
Adv. Oper. Res., 2009

2008
A new backtracking inexact BFGS method for symmetric nonlinear equations.
Comput. Math. Appl., 2008

2004
The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization.
Comput. Optim. Appl., 2004


  Loading...