Zhengyong Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhengyong Zhou has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Bo Yu
School of Mathematical Sciences, Dalian University of Technology, Dalian, People’s Republic of China
2 shared publications - Tianyu Yang
Chinese Academy of Sciences
2 shared publications - Yuming Dong
Chinese Academy of Sciences
2 shared publications - Zihan Liu
School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030000, China
2 shared publications Bo Yu
School of Mathematical Sciences, Dalian University of Technology, Dalian, Liaoning 116024, China
1 shared publicationHuanhuan Liu
Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
1 shared publication
Latest Publications
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 43 (2) , 815-823
A Hollow-Core Anti-Resonant Fiber Multi-Objective Multi-Modal Optimization Assisted by a Proxy Model Combined With Clustering Algorithm
To address the optimization problem of expensive multi-modal multi-objective black-box functions, this paper proposes a systematic optimization method based on a back propagation neural network as a proxy model, combined with clustering algorithm to cluster and differentiate multiple modes within the model. The method utilizes normalization and weighted summation of numerical experimental data to optimize the hyperparameters of the optimization algorithm's decision-making process. This approach resolves the multiple constraints of traditional optimization methods. Finally, applied to the hollow-core anti-resonant fiber with gap angle constraints to ensure its topological properties remain unchanged, the model optimizes three categories totaling six modes, optimizing the objectives of birefringence and loss. The top five optimal models achieve a minimum loss of $\text {3.54} \times \text {10}^\text{-3}$ dB/m, maximum birefringence of $\text {1.25} \times \text {10}^\text{-4}$, higher order modulation enhanced receiver of 50, and bandwidth of 1.425 $\mu$m.
- 3 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 43 (2) , 815-823
A Hollow-Core Anti-Resonant Fiber Multi-Objective Multi-Modal Optimization Assisted by a Proxy Model Combined With Clustering Algorithm
To address the optimization problem of expensive multi-modal multi-objective black-box functions, this paper proposes a systematic optimization method based on a back propagation neural network as a proxy model, combined with clustering algorithm to cluster and differentiate multiple modes within the model. The method utilizes normalization and weighted summation of numerical experimental data to optimize the hyperparameters of the optimization algorithm's decision-making process. This approach resolves the multiple constraints of traditional optimization methods. Finally, applied to the hollow-core anti-resonant fiber with gap angle constraints to ensure its topological properties remain unchanged, the model optimizes three categories totaling six modes, optimizing the objectives of birefringence and loss. The top five optimal models achieve a minimum loss of $\text {3.54} \times \text {10}^\text{-3}$ dB/m, maximum birefringence of $\text {1.25} \times \text {10}^\text{-4}$, higher order modulation enhanced receiver of 50, and bandwidth of 1.425 $\mu$m.
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 42 (15) , 5293-5301
Exhaustive Design and Statistical Analysis of HC-ARFs Based on Geometric Modeling
This paper establishes a widely applicable method for designing hollow-core anti-resonant fiber (HC-ARF) model based on geometric principles, which is feasible under practical manufacturing conditions and is defined by concise equations. We define this problem as a combinatorial optimization issue under the constraints of mixed integer nonlinearity. We iteratively refine the solution space through multiple steps, culminating in an integrated algorithm for automated modeling computation and data extraction. Through exhaustive calculation of models under limited conditions, we obtained multiple rigid HC-ARFs with low confinement loss (CL), low bend loss, and relatively high birefringence. The minimum CL is $\text{8.8}\times \text{10}^{-3}$ dB/m. At bending radius of 5 cm, the lowest bend loss is $\text{2.7}\times \text{10}^{-2}$ dB/m, and the highest birefringence is $\text{2.2}\times \text{10}^{-6}$ . After statistical analysis, two key factors influencing single anti-resonance layer HC-ARF have been determined: the number and radius of the rings hold the primary importance, followed by the rings arrangement. Further study demonstrates that the proposed model design method can be applied to various optical fiber designs.
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 42 (15) , 5293-5301
Exhaustive Design and Statistical Analysis of HC-ARFs Based on Geometric Modeling
This paper establishes a widely applicable method for designing hollow-core anti-resonant fiber (HC-ARF) model based on geometric principles, which is feasible under practical manufacturing conditions and is defined by concise equations. We define this problem as a combinatorial optimization issue under the constraints of mixed integer nonlinearity. We iteratively refine the solution space through multiple steps, culminating in an integrated algorithm for automated modeling computation and data extraction. Through exhaustive calculation of models under limited conditions, we obtained multiple rigid HC-ARFs with low confinement loss (CL), low bend loss, and relatively high birefringence. The minimum CL is $\text{8.8}\times \text{10}^{-3}$ dB/m. At bending radius of 5 cm, the lowest bend loss is $\text{2.7}\times \text{10}^{-2}$ dB/m, and the highest birefringence is $\text{2.2}\times \text{10}^{-6}$ . After statistical analysis, two key factors influencing single anti-resonance layer HC-ARF have been determined: the number and radius of the rings hold the primary importance, followed by the rings arrangement. Further study demonstrates that the proposed model design method can be applied to various optical fiber designs.
- 16 December 2023
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 98 (3) , 411-433
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
- 16 December 2023
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 98 (3) , 411-433
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
- 3 August 2022
- Published by Springer Nature in Journal of Global Optimization
- Vol. 85 (2) , 421-439
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- 3 August 2022
- Published by Springer Nature in Journal of Global Optimization
- Vol. 85 (2) , 421-439
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Open Access
- 4 July 2020
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2020, 1-10
A Comparison of Normal Cone Conditions for Homotopy Methods for Solving Inequality Constrained Nonlinear Programming Problems
Homotopy methods are powerful tools for solving nonlinear programming. Their global convergence can be generally established under conditions of the nonemptiness and boundness of the interior of the feasible set, the Positive Linear Independent Constraint Qualification (PLICQ), which is equivalent to the Mangasarian-Fromovitz Constraint Qualification (MFCQ), and the normal cone condition. This paper provides a comparison of the existing normal cone conditions used in homotopy methods for solving inequality constrained nonlinear programming.
- 4 July 2020
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2020, 1-10
Open AccessA Comparison of Normal Cone Conditions for Homotopy Methods for Solving Inequality Constrained Nonlinear Programming Problems
Homotopy methods are powerful tools for solving nonlinear programming. Their global convergence can be generally established under conditions of the nonemptiness and boundness of the interior of the feasible set, the Positive Linear Independent Constraint Qualification (PLICQ), which is equivalent to the Mangasarian-Fromovitz Constraint Qualification (MFCQ), and the normal cone condition. This paper provides a comparison of the existing normal cone conditions used in homotopy methods for solving inequality constrained nonlinear programming.
- Open Access
- 24 June 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-25
An Active Set Smoothing Method for Solving Unconstrained Minimax Problems
In this paper, an active set smoothing function based on the plus function is constructed for the maximum function. The active set strategy used in the smoothing function reduces the number of gradients and Hessians evaluations of the component functions in the optimization. Combing the active set smoothing function, a simple adjustment rule for the smoothing parameters, and an unconstrained minimization method, an active set smoothing method is proposed for solving unconstrained minimax problems. The active set smoothing function is continuously differentiable, and its gradient is locally Lipschitz continuous and strongly semismooth. Under the boundedness assumption on the level set of the objective function, the convergence of the proposed method is established. Numerical experiments show that the proposed method is feasible and efficient, particularly for the minimax problems with very many component functions.
- 24 June 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-25
Open AccessAn Active Set Smoothing Method for Solving Unconstrained Minimax Problems
In this paper, an active set smoothing function based on the plus function is constructed for the maximum function. The active set strategy used in the smoothing function reduces the number of gradients and Hessians evaluations of the component functions in the optimization. Combing the active set smoothing function, a simple adjustment rule for the smoothing parameters, and an unconstrained minimization method, an active set smoothing method is proposed for solving unconstrained minimax problems. The active set smoothing function is continuously differentiable, and its gradient is locally Lipschitz continuous and strongly semismooth. Under the boundedness assumption on the level set of the objective function, the convergence of the proposed method is established. Numerical experiments show that the proposed method is feasible and efficient, particularly for the minimax problems with very many component functions.
- 9 April 2020
- Published by Taylor & Francis in Optimization
- Vol. 70 (8) , 1791-1808
An aggregate homotopy method for solving unconstrained minimax problems
In this paper, an aggregate homotopy method is proposed to solve unconstrained minimax problems. The homotopy mapping is constructed by the linear homotopy and the aggregate function for the objective function, and the homotopy parameter is also used as the smoothing parameter of the aggregate function. Under some general assumptions, the existence and global convergence of a smooth homotopy path are proved for almost all starting points in or a ball set, and a stationary point of the unconstrained minimax problem can be obtained. A path-following procedure is introduced to numerically trace the homotopy path. When the smoothing parameter becomes small enough, an alternative strategy of the path-following procedure is given to reduce the ill-conditioning of the aggregate function, it uses the Newton method to solve a nonlinear system, which is derived from the first order optimality conditions for the unconstrained minimax problem. Numerical results show that the proposed method is efficient and robust.- 9 April 2020
- Published by Taylor & Francis in Optimization
- Vol. 70 (8) , 1791-1808
An aggregate homotopy method for solving unconstrained minimax problems
In this paper, an aggregate homotopy method is proposed to solve unconstrained minimax problems. The homotopy mapping is constructed by the linear homotopy and the aggregate function for the objective function, and the homotopy parameter is also used as the smoothing parameter of the aggregate function. Under some general assumptions, the existence and global convergence of a smooth homotopy path are proved for almost all starting points in or a ball set, and a stationary point of the unconstrained minimax problem can be obtained. A path-following procedure is introduced to numerically trace the homotopy path. When the smoothing parameter becomes small enough, an alternative strategy of the path-following procedure is given to reduce the ill-conditioning of the aggregate function, it uses the Newton method to solve a nonlinear system, which is derived from the first order optimality conditions for the unconstrained minimax problem. Numerical results show that the proposed method is efficient and robust.- 14 January 2019
- Published by Springer Nature in Journal of Global Optimization
- Vol. 74 (1) , 169-193
The locally Chen–Harker–Kanzow–Smale smoothing functions for mixed complementarity problems
- 14 January 2019
- Published by Springer Nature in Journal of Global Optimization
- Vol. 74 (1) , 169-193
The locally Chen–Harker–Kanzow–Smale smoothing functions for mixed complementarity problems
- Open Access
- 29 May 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-14
The Flattened Aggregate Constraint Homotopy Method for Nonlinear Programming Problems with Many Nonlinear Constraints
The aggregate constraint homotopy method uses a single smoothing constraint instead of-constraints to reduce the dimension of its homotopy map, and hence it is expected to be more efficient than the combined homotopy interior point method when the number of constraints is very large. However, the gradient and Hessian of the aggregate constraint function are complicated combinations of gradients and Hessians of all constraint functions, and hence they are expensive to calculate when the number of constraint functions is very large. In order to improve the performance of the aggregate constraint homotopy method for solving nonlinear programming problems, with few variables and many nonlinear constraints, a flattened aggregate constraint homotopy method, that can save much computation of gradients and Hessians of constraint functions, is presented. Under some similar conditions for other homotopy methods, existence and convergence of a smooth homotopy path are proven. A numerical procedure is given to implement the proposed homotopy method, preliminary computational results show its performance, and it is also competitive with the state-of-the-art solver KNITRO for solving large-scale nonlinear optimization.- 29 May 2014
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2014, 1-14
Open AccessThe Flattened Aggregate Constraint Homotopy Method for Nonlinear Programming Problems with Many Nonlinear Constraints
The aggregate constraint homotopy method uses a single smoothing constraint instead of-constraints to reduce the dimension of its homotopy map, and hence it is expected to be more efficient than the combined homotopy interior point method when the number of constraints is very large. However, the gradient and Hessian of the aggregate constraint function are complicated combinations of gradients and Hessians of all constraint functions, and hence they are expensive to calculate when the number of constraint functions is very large. In order to improve the performance of the aggregate constraint homotopy method for solving nonlinear programming problems, with few variables and many nonlinear constraints, a flattened aggregate constraint homotopy method, that can save much computation of gradients and Hessians of constraint functions, is presented. Under some similar conditions for other homotopy methods, existence and convergence of a smooth homotopy path are proven. A numerical procedure is given to implement the proposed homotopy method, preliminary computational results show its performance, and it is also competitive with the state-of-the-art solver KNITRO for solving large-scale nonlinear optimization. - 18 January 2013
- Published by Springer Nature in Journal of Global Optimization
- Vol. 58 (1) , 151-168
A smoothing homotopy method for variational inequality problems on polyhedral convex sets
- 18 January 2013
- Published by Springer Nature in Journal of Global Optimization
- Vol. 58 (1) , 151-168
A smoothing homotopy method for variational inequality problems on polyhedral convex sets