Mingyuan Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mingyuan Cao has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Yueting Yang
School of Mathematics and Statistics, Beihua University, Jilin 132013, China
8 shared publications - Qingdao Huang
School of Mathematics, Jilin University, Changchun 130012, China
3 shared publications - Chaoqian Li
School of Mathematics and Statistics, Yunan University, Kunming, China
2 shared publications Yiting Zhang
Beihua Univ, Sch Math & Stat, Jilin 132013, Peoples R China
2 shared publicationsYueting Yang
Beihua Univ, Sch Math & Stat, Jilin 132013, Peoples R China
2 shared publications- Bo Chen
School of Mathematics and Statistics, Beihua University, Jilin 132013, China
1 shared publication
Latest Publications
- Open Access
A Subspace Derivative-Free Conjugate Gradient Method for Solving Nonlinear Monotone Equations with Convex Constraints
We propose a novel subspace derivative-free conjugate gradient method for solving large-scale nonlinear monotone equations with convex constraints. At each iteration, the search direction is constructed by minimizing a quadratic model within a subspace spanned by the current negative function value vector and the two most recent search directions. The algorithm incorporates a hyperplane projection technique to generate feasible iterative points. Under reasonable assumptions, we establish the global convergence and R-linear convergence rate of the proposed method. Extensive numerical experiments on benchmark problems demonstrate that the new algorithm significantly outperforms state-of-the-art derivative-free methods in terms of number of iterations, function evaluations, and CPU time. The results confirm the efficiency and robustness of the proposed approach for solving large-scale monotone systems.
Open AccessA Subspace Derivative-Free Conjugate Gradient Method for Solving Nonlinear Monotone Equations with Convex Constraints
We propose a novel subspace derivative-free conjugate gradient method for solving large-scale nonlinear monotone equations with convex constraints. At each iteration, the search direction is constructed by minimizing a quadratic model within a subspace spanned by the current negative function value vector and the two most recent search directions. The algorithm incorporates a hyperplane projection technique to generate feasible iterative points. Under reasonable assumptions, we establish the global convergence and R-linear convergence rate of the proposed method. Extensive numerical experiments on benchmark problems demonstrate that the new algorithm significantly outperforms state-of-the-art derivative-free methods in terms of number of iterations, function evaluations, and CPU time. The results confirm the efficiency and robustness of the proposed approach for solving large-scale monotone systems.
- Open Access
- 31 December 2024
- Published by Acadlore Publishing Services Limited in Acadlore Transactions on Applied Mathematics and Statistics
- Vol. 02 (04) , 252-264
A New Spectral Three-Term Conjugate Gradient Method for Unconstrained Optimization and Its Application
In this paper, we derive a new conjugate gradient (CG) direction with random parameters which are obtained by minimizing the deviation between search direction matrix and self-scaled memoryless Broyden-Fletcher-Goldfard-Shanno (BFGS) update. We propose a new spectral three-term CG algorithm and establish the global convergence of new method for uniformly convex functions and general nonlinear functions, respectively. Numerical experiments show that our method has nice numerical performance on nonconvex functions and supply chain problems.
- 31 December 2024
- Published by Acadlore Publishing Services Limited in Acadlore Transactions on Applied Mathematics and Statistics
- Vol. 02 (04) , 252-264
Open AccessA New Spectral Three-Term Conjugate Gradient Method for Unconstrained Optimization and Its Application
In this paper, we derive a new conjugate gradient (CG) direction with random parameters which are obtained by minimizing the deviation between search direction matrix and self-scaled memoryless Broyden-Fletcher-Goldfard-Shanno (BFGS) update. We propose a new spectral three-term CG algorithm and establish the global convergence of new method for uniformly convex functions and general nonlinear functions, respectively. Numerical experiments show that our method has nice numerical performance on nonconvex functions and supply chain problems.
- Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (11) , 31790-31805
A novel nonmonotone trust region method based on the Metropolis criterion for solving unconstrained optimization
In this paper, we propose a novel nonmonotone trust region method that incorporates the Metropolis criterion to construct a new function sequence. This sequence is used to update both the trust region ratio and the iteration criterion, increasing the likelihood of accepting the current trial step and introducing randomness into the iteration process. When the current trial step is not accepted, we introduce an improved nonmonotone line search technique to continue the iteration. This approach significantly reduces the number of subproblems that need to be solved, thereby saving computational resources. The stochastic nonmonotone technique helps the algorithm avoid being trapped in the local optima, and a global convergence is guaranteed under certain conditions. Numerical experiments demonstrate that the algorithm can be more effectively applied to a broader range of problems.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (11) , 31790-31805
Open AccessA novel nonmonotone trust region method based on the Metropolis criterion for solving unconstrained optimization
In this paper, we propose a novel nonmonotone trust region method that incorporates the Metropolis criterion to construct a new function sequence. This sequence is used to update both the trust region ratio and the iteration criterion, increasing the likelihood of accepting the current trial step and introducing randomness into the iteration process. When the current trial step is not accepted, we introduce an improved nonmonotone line search technique to continue the iteration. This approach significantly reduces the number of subproblems that need to be solved, thereby saving computational resources. The stochastic nonmonotone technique helps the algorithm avoid being trapped in the local optima, and a global convergence is guaranteed under certain conditions. Numerical experiments demonstrate that the algorithm can be more effectively applied to a broader range of problems.
- Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (4) , 8497-8515
An adaptive simple model trust region algorithm based on new weak secant equations
In this work, we proposed a new trust region method for solving large-scale unconstrained optimization problems. The trust region subproblem with a simple form was constructed based on new weak secant equations, which utilized both gradient and function values and available information from the three most recent points. A modified Metropolis criterion was used to determine whether to accept the trial step, and an adaptive strategy was used to update the trust region radius. The global convergence and locally superlinearly convergence of the new algorithm were established under appropriate conditions. Numerical experiments showed that the proposed algorithm was effective.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 9 (4) , 8497-8515
Open AccessAn adaptive simple model trust region algorithm based on new weak secant equations
In this work, we proposed a new trust region method for solving large-scale unconstrained optimization problems. The trust region subproblem with a simple form was constructed based on new weak secant equations, which utilized both gradient and function values and available information from the three most recent points. A modified Metropolis criterion was used to determine whether to accept the trial step, and an adaptive strategy was used to update the trust region radius. The global convergence and locally superlinearly convergence of the new algorithm were established under appropriate conditions. Numerical experiments showed that the proposed algorithm was effective.
- 6 October 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 143
A mini-batch algorithm for large-scale learning problems with adaptive step size
- 6 October 2023
- Published by Elsevier in Digital Signal Processing
- Vol. 143
A mini-batch algorithm for large-scale learning problems with adaptive step size
- Open Access
A New Adaptive Accelerated Levenberg–Marquardt Method for Solving Nonlinear Equations and Its Applications in Supply Chain Problems
In this paper, a new adaptive Levenberg–Marquardt method is proposed to solve the nonlinear equations including supply chain optimization problems. We present a new adaptive update rule which is a segmented function on the ratio between the actual and predicted reductions of the objective function to accept a large number of unsuccessful iterations and avoid jumping in local areas. The global convergence and quadratic convergence of the proposed method are proved by using the trust region technique and local error bound condition, respectively. In addition, we use the proposed algorithm to test on the symmetric and asymmetric linear equations. Numerical results show that the proposed method has good numerical performance and development prospects. Furthermore, we apply the algorithm to solve the fresh agricultural products supply chain optimization problems.
Open AccessA New Adaptive Accelerated Levenberg–Marquardt Method for Solving Nonlinear Equations and Its Applications in Supply Chain Problems
In this paper, a new adaptive Levenberg–Marquardt method is proposed to solve the nonlinear equations including supply chain optimization problems. We present a new adaptive update rule which is a segmented function on the ratio between the actual and predicted reductions of the objective function to accept a large number of unsuccessful iterations and avoid jumping in local areas. The global convergence and quadratic convergence of the proposed method are proved by using the trust region technique and local error bound condition, respectively. In addition, we use the proposed algorithm to test on the symmetric and asymmetric linear equations. Numerical results show that the proposed method has good numerical performance and development prospects. Furthermore, we apply the algorithm to solve the fresh agricultural products supply chain optimization problems.
- 1 January 2023
- Published by International Press of Boston in Communications in Mathematical Sciences
- Vol. 21 (2) , 543-557
A derivative-free conjugate gradient method for large-scale nonlinear systems of monotone equations
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2023
- Published by International Press of Boston in Communications in Mathematical Sciences
- Vol. 21 (2) , 543-557
A derivative-free conjugate gradient method for large-scale nonlinear systems of monotone equations
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- Open Access
- 1 January 2022
- Published by Wiley in Journal of Mathematics
- Vol. 2022 (1)
A New Spectral Three‐Term Conjugate Gradient Method with Random Parameter Based on Modified Secant Equation and Its Application to Low‐Carbon Supply Chain Optimization
In this work, considering the advantages of spectral conjugate gradient method and quasi‐Newton method, a spectral three‐term conjugate gradient method with random parameter is proposed. The parameter in the search direction of the new method is determined by minimizing the Frobenius norm of difference between search direction matrix and self‐scaled memoryless BFGS matrix based on modified secant equation. Then, the search direction satisfying the sufficient descent condition is obtained. The global convergence of new method is proved under appropriate assumptions. Numerical experiments show that our method has better performance by comparing with the up‐to‐date method. Furthermore, the new method has been successfully applied to the optimization of low‐carbon supply chain.
- 1 January 2022
- Published by Wiley in Journal of Mathematics
- Vol. 2022 (1)
Open AccessA New Spectral Three‐Term Conjugate Gradient Method with Random Parameter Based on Modified Secant Equation and Its Application to Low‐Carbon Supply Chain Optimization
In this work, considering the advantages of spectral conjugate gradient method and quasi‐Newton method, a spectral three‐term conjugate gradient method with random parameter is proposed. The parameter in the search direction of the new method is determined by minimizing the Frobenius norm of difference between search direction matrix and self‐scaled memoryless BFGS matrix based on modified secant equation. Then, the search direction satisfying the sufficient descent condition is obtained. The global convergence of new method is proved under appropriate assumptions. Numerical experiments show that our method has better performance by comparing with the up‐to‐date method. Furthermore, the new method has been successfully applied to the optimization of low‐carbon supply chain.
- 1 June 2021
- Published by Global Science Press in Journal of Computational Mathematics
- Vol. 39 (3) , 358-374
An Adaptive Trust-Region Method for Generalized Eigenvalues of Symmetric Tensors
Journal of Computational Mathematics (JCM) is an international scientific computing journal founded by Professor Feng Kang in 1983, which is the first Chinese computational mathematics journal published in English. JCM covers all branches of modern computational mathematics such as numerical linear algebra, numerical optimization, computational geometry, numerical PDEs, and inverse problems. JCM has been sponsored by the Institute of Computational Mathematics of the Chinese Academy of Sciences.
- 1 June 2021
- Published by Global Science Press in Journal of Computational Mathematics
- Vol. 39 (3) , 358-374
An Adaptive Trust-Region Method for Generalized Eigenvalues of Symmetric Tensors
Journal of Computational Mathematics (JCM) is an international scientific computing journal founded by Professor Feng Kang in 1983, which is the first Chinese computational mathematics journal published in English. JCM covers all branches of modern computational mathematics such as numerical linear algebra, numerical optimization, computational geometry, numerical PDEs, and inverse problems. JCM has been sponsored by the Institute of Computational Mathematics of the Chinese Academy of Sciences.
- 28 February 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (1) , 113-129
A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors
- 28 February 2021
- Published by Wiley in International Transactions in Operational Research
- Vol. 29 (1) , 113-129
A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors