var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fpxie98.github.io%2Fxpcpublication.bib&jsonp=1&theme=side&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fpxie98.github.io%2Fxpcpublication.bib&jsonp=1&theme=side\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fpxie98.github.io%2Fxpcpublication.bib&jsonp=1&theme=side\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2025\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n ReMU: Regional Minimal Updating for Model-Based Derivative-Free Optimization.\n \n \n \n \n\n\n \n Xie, P.; and Wild, S. M.\n\n\n \n\n\n\n 2025.\n \n\n\n\n
\n\n\n\n \n \n \"ReMU:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{xie2025remuregionalminimalupdating,\n      title={ReMU: Regional Minimal Updating for Model-Based Derivative-Free Optimization}, \n      author={Pengcheng Xie and Stefan M. Wild},\n      year={2025},\n      eprint={2504.03606},\n      archivePrefix={arXiv},\n      primaryClass={math.OC},\n      url={https://arxiv.org/abs/2504.03606}, \n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A novel numerical method tailored for unconstrained optimization problems.\n \n \n \n \n\n\n \n Li, L.; Xie, P.; and Zhang, L.\n\n\n \n\n\n\n 2025.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{li2025novelnumericalmethodtailored,\n      title={A novel numerical method tailored for unconstrained optimization problems}, \n      author={Lin Li and Pengcheng Xie and Li Zhang},\n      year={2025},\n      eprint={2504.02832},\n      archivePrefix={arXiv},\n      primaryClass={math.OC},\n      url={https://arxiv.org/abs/2504.02832}, \n}\n\n\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Least H2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms.\n \n \n \n \n\n\n \n Xie, P.; and Yuan, Y.\n\n\n \n\n\n\n IMA Journal of Numerical Analysis,drae106. 03 2025.\n \n\n\n\n
\n\n\n\n \n \n \"LeastPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{10.1093/imanum/drae106,\n    author = {Pengcheng Xie and Ya-xiang Yuan},\n    title = {Least H2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms},\n    journal = {IMA Journal of Numerical Analysis},\n    pages = {drae106},\n    year = {2025},\n    month = {03},\n    abstract = {One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the \\$H^\\{2\\}\\$ norm of the difference between neighboring quadratic models. The motivation for applying the \\$H^\\{2\\}\\$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of \\$H^\\{2\\}\\$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least \\$H^\\{2\\}\\$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.},\n    issn = {0272-4979},\n    doi = {10.1093/imanum/drae106},\n    url = {https://doi.org/10.1093/imanum/drae106},\n    eprint = {https://academic.oup.com/imajna/advance-article-pdf/doi/10.1093/imanum/drae106/62210513/drae106.pdf},\n}\n\n\n\n\n\n
\n
\n\n\n
\n One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^\\{2\\}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^\\{2\\}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^\\{2\\}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^\\{2\\}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A spectral Levenberg-Marquardt-Deflation method for multiple solutions of semilinear elliptic systems.\n \n \n \n \n\n\n \n Li, L.; Zhou, Y.; Xie, P.; and Li, H.\n\n\n \n\n\n\n 2025.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{li2025spectrallevenbergmarquardtdeflationmethodmultiple,\n      title={A spectral Levenberg-Marquardt-Deflation method for multiple solutions of semilinear elliptic systems}, \n      author={Lin Li and Yuheng Zhou and Pengcheng Xie and Huiyuan Li},\n      year={2025},\n      eprint={2503.01912},\n      archivePrefix={arXiv},\n      primaryClass={math.OC},\n      url={https://arxiv.org/abs/2503.01912}, \n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Improved Adaptive Orthogonal Basis Deflation Method for Multiple Solutions with Applications to Nonlinear Elliptic Equations in Varying Domains.\n \n \n \n \n\n\n \n Ye, Y.; Li, L.; Xie, P.; and Yu, H.\n\n\n \n\n\n\n 2025.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{ye2025improvedadaptiveorthogonalbasis,\n      title={An Improved Adaptive Orthogonal Basis Deflation Method for Multiple Solutions with Applications to Nonlinear Elliptic Equations in Varying Domains}, \n      author={Yangyi Ye and Lin Li and Pengcheng Xie and Haijun Yu},\n      year={2025},\n      eprint={2503.07624},\n      archivePrefix={arXiv},\n      primaryClass={math.NA},\n      url={https://arxiv.org/abs/2503.07624}, \n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimization approaches for solving inverse problems must account for uncertainty in both data and downstream decisions.\n \n \n \n \n\n\n \n Dzahini, K. J.; Wild, S. M.; and Xie, P.\n\n\n \n\n\n\n 2025.\n Position paper, Inverse Methods for Complex Systems under Uncertainty Workshop, Sponsored by the U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research\n\n\n\n
\n\n\n\n \n \n \"OptimizationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{postionpaper2025optimization,\n  author       = {K. J. Dzahini and S. M. Wild and P. Xie},\n  title        = {Optimization approaches for solving inverse problems must account for uncertainty in both data and downstream decisions},\n  year         = {2025},\n  note         = {Position paper, Inverse Methods for Complex Systems under Uncertainty Workshop, Sponsored by the U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research},\n  url          = {https://www.orau.gov/support_files/2025InverseMethods/WildS.pdf}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Derivative-Free Method Using a New Underdetermined Quadratic Interpolation Model.\n \n \n \n \n\n\n \n Xie, P.; and Yuan, Y.\n\n\n \n\n\n\n SIAM Journal on Optimization, 35(2): 1110-1133. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{xieyuannew,\nauthor = {Xie, Pengcheng and Yuan, Ya-xiang},\ntitle = {A Derivative-Free Method Using a New Underdetermined Quadratic Interpolation Model},\njournal = {SIAM Journal on Optimization},\nvolume = {35},\nnumber = {2},\npages = {1110-1133},\nyear = {2025},\ndoi = {10.1137/23M1582023},\n\nURL = { \n    \n        https://doi.org/10.1137/23M1582023\n    \n    \n\n},\neprint = { \n    \n        https://doi.org/10.1137/23M1582023\n    \n    \n\n}\n,\n    abstract = { Abstract. We analyze the least norm type underdetermined quadratic interpolation model proposed by Conn and Toint [An algorithm using quadratic interpolation for unconstrained derivative free optimization, 1996] from the perspective of the property of trust-region iteration. We find the Karush–Kuhn–Tucker multiplier’s nondeterminacy when constructing a quadratic model considering the trust-region iteration in the case where the current iteration point is on the boundary of the trust region. The lack of the quadratic model’s uniqueness caused by the Karush–Kuhn–Tucker multiplier’s nondeterminacy leads us to propose a new model to consequently improve the model by selectively treating the previously obtained underdetermined quadratic model as a quadratic model or a linear one. A new derivative-free method is given by introducing the improved underdetermined quadratic interpolation model considering the optimality of the model based on the trust-region iteration. The theoretical motivation, property, computational details, and the quadratic model’s formula derived from the Karush–Kuhn–Tucker conditions are discussed. The formula is implementation-friendly for the existing model-based derivative-free methods. The numerical results with released codes support the advantages of our quadratic model in the derivative-free optimization methods. To the best of our knowledge, this is the first work considering the property of trust-region iteration and the model’s optimality when constructing the underdetermined quadratic model for derivative-free trust-region methods. }\n}\n\n\n\n\n
\n
\n\n\n
\n Abstract. We analyze the least norm type underdetermined quadratic interpolation model proposed by Conn and Toint [An algorithm using quadratic interpolation for unconstrained derivative free optimization, 1996] from the perspective of the property of trust-region iteration. We find the Karush–Kuhn–Tucker multiplier’s nondeterminacy when constructing a quadratic model considering the trust-region iteration in the case where the current iteration point is on the boundary of the trust region. The lack of the quadratic model’s uniqueness caused by the Karush–Kuhn–Tucker multiplier’s nondeterminacy leads us to propose a new model to consequently improve the model by selectively treating the previously obtained underdetermined quadratic model as a quadratic model or a linear one. A new derivative-free method is given by introducing the improved underdetermined quadratic interpolation model considering the optimality of the model based on the trust-region iteration. The theoretical motivation, property, computational details, and the quadratic model’s formula derived from the Karush–Kuhn–Tucker conditions are discussed. The formula is implementation-friendly for the existing model-based derivative-free methods. The numerical results with released codes support the advantages of our quadratic model in the derivative-free optimization methods. To the best of our knowledge, this is the first work considering the property of trust-region iteration and the model’s optimality when constructing the underdetermined quadratic model for derivative-free trust-region methods. \n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sufficient conditions for error distance reduction in the ℓ2-norm trust region between minimizers of local nonconvex multivariate quadratic approximates.\n \n \n \n \n\n\n \n Xie, P.\n\n\n \n\n\n\n Journal of Computational and Applied Mathematics, 453: 116146. 2025.\n \n\n\n\n
\n\n\n\n \n \n \"SufficientPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 19 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{XIE2025116146,\ntitle = {Sufficient conditions for error distance reduction in the ℓ2-norm trust region between minimizers of local nonconvex multivariate quadratic approximates},\njournal = {Journal of Computational and Applied Mathematics},\nvolume = {453},\npages = {116146},\nyear = {2025},\nissn = {0377-0427},\ndoi = {https://doi.org/10.1016/j.cam.2024.116146},\nurl = {https://www.sciencedirect.com/science/article/pii/S0377042724003959},\nauthor = {Pengcheng Xie},\nkeywords = {optimization},\nabstract = {This paper analyzes the sufficient conditions for distance reduction between minimizers of local nonconvex quadratic approximate functions with diagonal Hessian in the ℓ2-norm trust regions after two iterations. Some examples illustrate the theoretical results of this study.}\n}\n\n
\n
\n\n\n
\n This paper analyzes the sufficient conditions for distance reduction between minimizers of local nonconvex quadratic approximate functions with diagonal Hessian in the ℓ2-norm trust regions after two iterations. Some examples illustrate the theoretical results of this study.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2024\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Barycenter of Weight Coefficient Region of Least Weighted $H^2$ Norm Updating Quadratic Models with Vanishing Trust-region Radius.\n \n \n \n\n\n \n Xie, P.; and Wild, S. M.\n\n\n \n\n\n\n SIAM NCC 2024, Early Career Travel Award. 2024.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{xie2024bary,\nauthor={Pengcheng Xie and Stefan M. Wild},\n  title = {Barycenter of Weight Coefficient Region of Least Weighted $H^2$ Norm Updating Quadratic Models with Vanishing Trust-region Radius},\n  year = {2024},\n  journal = {SIAM NCC 2024, Early Career Travel Award},\nkeywords = {optimization},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n A Novel Local Analysis of Objectives Approximated by Neural Network: L-Change.\n \n \n \n\n\n \n Pengcheng Xie, e.\n\n\n \n\n\n\n 2024.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@misc{xie2024lchange,\nauthor={Pengcheng Xie, etc.},\n  title = {A Novel Local Analysis of Objectives Approximated by Neural Network: L-Change},\n  year = {2024},\n  journal = {International Conference on Mathematical Theory of Deep Learning (MTDL)},\nkeywords = {machine learning, neural network},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Relationship between $Λ$-poisedness in Derivative-Free Optimization and Outliers in Local Outlier Factor.\n \n \n \n \n\n\n \n Xie, P.\n\n\n \n\n\n\n 2024.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@misc{zhang2024relationshiplambdapoisednessderivativefreeoptimization,\n      title={On the Relationship between $\\Lambda$-poisedness in Derivative-Free Optimization and Outliers in Local Outlier Factor}, \n      author={Pengcheng Xie},\n      year={2024},\n      eprint={2407.17529},\n      archivePrefix={arXiv},\n      primaryClass={math.OC},\n      url={https://arxiv.org/abs/2407.17529}, \nkeywords = {optimization, approximation},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Low Computation Cost Cubic Regularized Quasi-Newton Method for Distributed Optimization: LC3RQN.\n \n \n \n \n\n\n \n Hu, W.; Xie, P.; Zhang, L.; and Yuan, Y.\n\n\n \n\n\n\n . 2024.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 23 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{hu2024lc3rqn,\n  author = {W. Hu and P. Xie and L. Zhang and Y.-x. Yuan},\n  title = {A Low Computation Cost Cubic Regularized Quasi-Newton Method for Distributed Optimization: LC3RQN},\n  year = {2024},\n  url = {https://lsec.cc.ac.cn/~moa2024/Poster_List.pdf},\nkeywords = {optimization},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n An efficient derivative-free method for finding multiple solutions.\n \n \n \n\n\n \n \n\n\n \n\n\n\n 2024.\n To be posted on arXiv\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@misc{2023multiple,\n  title = {An efficient derivative-free method for finding multiple solutions},\n  year = {2024},\n  note = {To be posted on arXiv},\nkeywords = {numerical PDE},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A note on the invariant distribution of a stochastic dynamical system.\n \n \n \n \n\n\n \n Xie, P.\n\n\n \n\n\n\n 2024.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@misc{xie2023invariant,\n  author = {P. Xie},\n  title = {A note on the invariant distribution of a stochastic dynamical system},\n  year = {2024},\n  doi = {10.12074/202304.01048},\n  url = {https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4910398},\nkeywords = {control},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Modeling and Optimization of a Multi-dam System.\n \n \n \n \n\n\n \n Xie, P.\n\n\n \n\n\n\n Applied and Computational Mathematics, 13(5): 140-152. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{10.11648/j.acm.20241305.13,\n  author = {Pengcheng Xie},\n  title = {The Modeling and Optimization of a Multi-dam System},\n  journal = {Applied and Computational Mathematics},\n  volume = {13},\n  number = {5},\n  pages = {140-152},\n  doi = {10.11648/j.acm.20241305.13},\n  url = {https://doi.org/10.11648/j.acm.20241305.13},\n  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.acm.20241305.13},\n  abstract = {In this paper, we present a maintenance plan for the Kariba Dam in Africa. The Kariba Dam, a double curvature concrete arch dam in Zambia's capital, is crucial for regional energy and water management. Ensuring its safety and functionality is essential. This study provides a comprehensive analysis and maintenance plan to safeguard the dam's long-term viability. Our mathematical analysis begins with a threshold evaluation of three proposed options, considering costs such as relocation, dam removal, construction of new dams, repairs, and ecological damage, as well as benefits like energy generation, flood prevention, employment, tourism, and ecological protection. The data-driven analysis indicates that our option is the most economically viable. We assess water management capabilities, using them as a safety coefficient for the dams. We selected 30 seed points along the riverbank to establish dams. Our recommendation is to increase the number of dams and ensure their strategic distribution. An assessment model based on the analytic hierarchy process was then developed, focusing on three factors: safety, economy, and population. We determined the weights of each factor. The optimal scheme was identified through this model, and the sensitivity of the results was also evaluated. The greatest impact under extreme conditions was found. This paper provides the details of the theoretical analysis and the numerical experiments, which include the use of modeling, optimization, mathematical programming, and so on.},\n year = {2024},\nkeywords = {optimization},\n}\n\n
\n
\n\n\n
\n In this paper, we present a maintenance plan for the Kariba Dam in Africa. The Kariba Dam, a double curvature concrete arch dam in Zambia's capital, is crucial for regional energy and water management. Ensuring its safety and functionality is essential. This study provides a comprehensive analysis and maintenance plan to safeguard the dam's long-term viability. Our mathematical analysis begins with a threshold evaluation of three proposed options, considering costs such as relocation, dam removal, construction of new dams, repairs, and ecological damage, as well as benefits like energy generation, flood prevention, employment, tourism, and ecological protection. The data-driven analysis indicates that our option is the most economically viable. We assess water management capabilities, using them as a safety coefficient for the dams. We selected 30 seed points along the riverbank to establish dams. Our recommendation is to increase the number of dams and ensure their strategic distribution. An assessment model based on the analytic hierarchy process was then developed, focusing on three factors: safety, economy, and population. We determined the weights of each factor. The optimal scheme was identified through this model, and the sensitivity of the results was also evaluated. The greatest impact under extreme conditions was found. This paper provides the details of the theoretical analysis and the numerical experiments, which include the use of modeling, optimization, mathematical programming, and so on.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A new two-dimensional model-based subspace method for large-scale unconstrained derivative-free optimization: 2D-MoSub.\n \n \n \n \n\n\n \n Xie, P.; and Yuan, Y.\n\n\n \n\n\n\n . 2023.\n Under review\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{xie2023twodimensional,\n  author = {P. Xie and Y.-x. Yuan},\n  title = {A new two-dimensional model-based subspace method for large-scale unconstrained derivative-free optimization: 2D-MoSub},\n  year = {2023},\n  note = {Under review},\n  doi = {10.48550/arXiv.2309.14855},\n  url = {https://arxiv.org/pdf/2309.14855.pdf},\nkeywords = {optimization},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Derivative-free optimization with transformed objective functions (DFOTO) and the algorithm based on the least Frobenius norm updating quadratic model.\n \n \n \n \n\n\n \n Xie, P.; and Yuan, Y.\n\n\n \n\n\n\n Journal of the Operations Research Society of China. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Derivative-freePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{xie2023dfoto,\n  author = {P. Xie and Y. Yuan},\n  title = {Derivative-free optimization with transformed objective functions {(DFOTO)} and the algorithm based on the least {Frobenius} norm updating quadratic model},\n  year = {2023},\n  journal = {Journal of the Operations Research Society of China},\n  url = {https://link.springer.com/article/10.1007/s40305-023-00532-x},\nkeywords = {optimization},\n}\n\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A derivative-free optimization algorithm combining line-search and trust-region techniques.\n \n \n \n \n\n\n \n Xie, P.; and Yuan, Y.\n\n\n \n\n\n\n Chinese Annals of Mathematics, Series B, 44(5): 719-734. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"A1\n  \n \n \n \"A2\n  \n \n \n \"A3\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{xie2023linesearch,\n  author = {P. Xie and Y.-x. Yuan},\n  title = {A derivative-free optimization algorithm combining line-search and trust-region techniques},\n  journal = {Chinese Annals of Mathematics, Series B},\n  volume = {44},\n  number = {5},\n  pages = {719-734},\n  year = {2023},\n  url1 = {https://link.springer.com/article/10.1007/s11401-023-0040-y},\n  url2 = {https://camath.fudan.edu.cn/camb/ch/reader/create_pdf.aspx?file_no=202305005&flag=1},\n  url3 = {https://camath.fudan.edu.cn/camb/ch/reader/view_abstract.aspx?file_no=202305005&flag=1},\nkeywords = {optimization},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A derivative-free trust-region method for optimization on the ellipsoid.\n \n \n \n \n\n\n \n Xie, P.\n\n\n \n\n\n\n Journal of Physics: Conference Series, 2620: 012007. 2023.\n Presented in 2023 International Conference on Advances in Computer Science and Engineering Technology (ACSE2023)\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{xie2023ellipsoid,\n  author = {P. Xie},\n  title = {A derivative-free trust-region method for optimization on the ellipsoid},\n  journal = {Journal of Physics: Conference Series},\n  volume = {2620},\n  pages = {012007},\n  year = {2023},\n  url = {https://iopscience.iop.org/article/10.1088/1742-6596/2620/1/012007/pdf},\n  note = {Presented in 2023 International Conference on Advances in Computer Science and Engineering Technology (ACSE2023)},\nkeywords = {optimization},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Simulation of interaction of folded waveguide space traveling wave tubes with derivative-free mixed-integer based NEWUOA algorithm.\n \n \n \n \n\n\n \n Li, S.; Xie, P.; and Z. Zhou, e. a.\n\n\n \n\n\n\n In 2021 7th International Conference on Computer and Communications (ICCC), pages 1215–1219, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"SimulationPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@inproceedings{li2021newuoa,\n  author = {S. Li and P. Xie and Z. Zhou, et al.},\n  title = {Simulation of interaction of folded waveguide space traveling wave tubes with derivative-free mixed-integer based NEWUOA algorithm},\n  booktitle = {2021 7th International Conference on Computer and Communications (ICCC)},\n  year = {2021},\n  pages = {1215--1219},\n  doi = {10.1109/ICCC54389.2021.9674410},\n  url = {https://ieeexplore.ieee.org/document/9674410},\nkeywords = {optimization},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Parametric resonant control of macroscopic behaviors of multiple oscillators.\n \n \n \n \n\n\n \n Xie, P.; and Tao, M.\n\n\n \n\n\n\n In 2019 American Control Conference (ACC), pages 1898–1905, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"ParametricPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@inproceedings{xie2019acc,\n  author = {P. Xie and M. Tao},\n  title = {Parametric resonant control of macroscopic behaviors of multiple oscillators},\n  booktitle = {2019 American Control Conference (ACC)},\n  year = {2019},\n  pages = {1898--1905},\n  doi = {10.23919/ACC.2019.8814709},\n  url = {https://ieeexplore.ieee.org/document/8814709},\nkeywords = {control},\n}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);