Guanglu Zhang
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
Guanglu Zhang has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Jonathan Cagan
Department of Mechanical Engineering, Carnegie Mellon University, Pittsburgh, USA
12 shared publications - Daniel A. McAdams
Fellow ASME Department of Mechanical Engineering, Texas A&M University, College Station, TX 77840
5 shared publications - Douglas Allaire
Texas A&M University
5 shared publications - Leah Chong
University of Texas at Austin, Austin, Texas, USA
3 shared publications - Christopher McComb
Carnegie Mellon University
2 shared publications Douglas Allaire
Department of Mechanical Engineering, Texas A&M University, College Station, TX, United States of America
2 shared publications
Latest Publications
- Open Access
- 3 April 2026
- Published by Oxford University Press (OUP) in PNAS Nexus
- Vol. 5 (4)
Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization
This paper introduces a numerical method to enclose the global minimum of a nonlinear function subject to simple bounds on the variables. Using interval analysis, coupled with the computational power and architecture of graphics processing units (GPUs), the method iteratively rules out the regions in the search domain where the global minimum cannot exist and leaves a finite set of regions where the global minimum must exist. For effectiveness, because of the rigor of interval analysis, the method is guaranteed to enclose the global minimum even in the presence of rounding errors. For efficiency, the method employs a novel GPU-based single program, single data parallel programming style to circumvent major GPU performance bottlenecks, and a variable cycling technique is also integrated into the method to reduce computational cost when minimizing large-scale nonlinear functions. The method is validated by minimizing 11 benchmark test functions with scalable dimensions, including the well-known Ackley function, Griewank function, Levy function, Rastrigin function, and Rosenbrock function. These benchmark test functions represent grand challenges of global optimization, and enclosing the guaranteed global minimum of these benchmark test functions with >80 dimensions has not been reported in the literature. Our method completely searches the feasible domain and successfully encloses the guaranteed global minimum of these 11 benchmark test functions with up to 10,000 dimensions using only one GPU in a reasonable computation time, far exceeding the reported results in the literature due to the unique method design and implementation based on GPU architecture.
- 3 April 2026
- Published by Oxford University Press (OUP) in PNAS Nexus
- Vol. 5 (4)
Open AccessGlobal optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization
This paper introduces a numerical method to enclose the global minimum of a nonlinear function subject to simple bounds on the variables. Using interval analysis, coupled with the computational power and architecture of graphics processing units (GPUs), the method iteratively rules out the regions in the search domain where the global minimum cannot exist and leaves a finite set of regions where the global minimum must exist. For effectiveness, because of the rigor of interval analysis, the method is guaranteed to enclose the global minimum even in the presence of rounding errors. For efficiency, the method employs a novel GPU-based single program, single data parallel programming style to circumvent major GPU performance bottlenecks, and a variable cycling technique is also integrated into the method to reduce computational cost when minimizing large-scale nonlinear functions. The method is validated by minimizing 11 benchmark test functions with scalable dimensions, including the well-known Ackley function, Griewank function, Levy function, Rastrigin function, and Rosenbrock function. These benchmark test functions represent grand challenges of global optimization, and enclosing the guaranteed global minimum of these benchmark test functions with >80 dimensions has not been reported in the literature. Our method completely searches the feasible domain and successfully encloses the guaranteed global minimum of these 11 benchmark test functions with up to 10,000 dimensions using only one GPU in a reasonable computation time, far exceeding the reported results in the literature due to the unique method design and implementation based on GPU architecture.
- 5 November 2024
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 24 (12) , 1-36
A Multi-Sized Unit Cell Method for the Design of LPBF Lattice Support Structures Concerning Complex Geometries
Composed of individual unit cells strategically arranged to achieve a desired function, lattices are a promising solution for laser powder bed fusion support structure design in additive manufacturing. Despite their many advantages (e.g., multifunctionality and reduced material cost), prior work in lattice support structure design primarily focuses on horizontal support domains that are not translatable to support domains for complex geometries, thereby limiting their application. This work introduces a multi-sized unit cell design optimization (MSO) method to create lattice support structures (LSS) for parts with complex geometries. The proposed method utilizes voxelization to generate LSS using box-like unit cells of different sizes. It also allows for efficient, high-dimensional design optimization for the types and locations of user-specified unit cells through a modified simulated annealing-based optimization algorithm. The effectiveness and efficiency of the MSO method are demonstrated through the case study of an adapter pipe for a high-temperature heat exchanger. For this demonstration, LSS using multi-sized unit cells is designed to increase heat transfer rate while satisfying structural integrity and material cost constraints. The case study results indicate that the design of the LSS derived from the MSO method fulfills all constraints, including the design constraint of 50% material cost reduction, compared to the solid support structure. In contrast, the lattice support structure designs derived from equal-sized unit cell methods either cannot satisfy all design constraints or have a lower heat transfer rate than the design of the MSO method.
- 5 November 2024
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 24 (12) , 1-36
A Multi-Sized Unit Cell Method for the Design of LPBF Lattice Support Structures Concerning Complex Geometries
Composed of individual unit cells strategically arranged to achieve a desired function, lattices are a promising solution for laser powder bed fusion support structure design in additive manufacturing. Despite their many advantages (e.g., multifunctionality and reduced material cost), prior work in lattice support structure design primarily focuses on horizontal support domains that are not translatable to support domains for complex geometries, thereby limiting their application. This work introduces a multi-sized unit cell design optimization (MSO) method to create lattice support structures (LSS) for parts with complex geometries. The proposed method utilizes voxelization to generate LSS using box-like unit cells of different sizes. It also allows for efficient, high-dimensional design optimization for the types and locations of user-specified unit cells through a modified simulated annealing-based optimization algorithm. The effectiveness and efficiency of the MSO method are demonstrated through the case study of an adapter pipe for a high-temperature heat exchanger. For this demonstration, LSS using multi-sized unit cells is designed to increase heat transfer rate while satisfying structural integrity and material cost constraints. The case study results indicate that the design of the LSS derived from the MSO method fulfills all constraints, including the design constraint of 50% material cost reduction, compared to the solid support structure. In contrast, the lattice support structure designs derived from equal-sized unit cell methods either cannot satisfy all design constraints or have a lower heat transfer rate than the design of the MSO method.
- 6 December 2023
- Published by Wiley in Journal of Mechanical Design
- Vol. 146 (4) , 1-60
A GPU-Based Parallel Region Classification Method for Continuous Constraint Satisfaction Problems
Continuous constraint satisfaction is prevalent in many science and engineering fields. When solving continuous constraint satisfaction problems, it is more advantageous for practitioners to derive all feasible regions (i.e., the solution space) rather than a limited number of solution points, since these feasible regions facilitate design concept generation and design tradeoff evaluation. Several central processing unit (CPU)-based branch-and-prune methods and geometric approximation methods have been proposed in prior research to derive feasible regions for continuous constraint satisfaction problems. However, these methods have not been extensively adopted in practice, mainly because of their high computational expense. To overcome the computational bottleneck of extant CPU-based methods, this paper introduces a GPU-based parallel region classification method to derive feasible regions for continuous constraint satisfaction problems in a reasonable computational time. Using interval arithmetic, coupled with the computational power of GPU, this method iteratively partitions the design space into many subregions and classifies these subregions as feasible, infeasible, and indeterminate regions. To visualize these classified regions in the design space, a planar visualization approach that projects all classified regions into one figure is also proposed. The GPU-based parallel region classification method and the planar visualization approach are validated through two case studies about the bird function and the welded beam design. These case studies show that the method and the approach can solve the continuous constraint satisfaction problems and visualize the results effectively and efficiently. A four-step procedure for implementing the method and the approach in practice is also outlined.
- 6 December 2023
- Published by Wiley in Journal of Mechanical Design
- Vol. 146 (4) , 1-60
A GPU-Based Parallel Region Classification Method for Continuous Constraint Satisfaction Problems
Continuous constraint satisfaction is prevalent in many science and engineering fields. When solving continuous constraint satisfaction problems, it is more advantageous for practitioners to derive all feasible regions (i.e., the solution space) rather than a limited number of solution points, since these feasible regions facilitate design concept generation and design tradeoff evaluation. Several central processing unit (CPU)-based branch-and-prune methods and geometric approximation methods have been proposed in prior research to derive feasible regions for continuous constraint satisfaction problems. However, these methods have not been extensively adopted in practice, mainly because of their high computational expense. To overcome the computational bottleneck of extant CPU-based methods, this paper introduces a GPU-based parallel region classification method to derive feasible regions for continuous constraint satisfaction problems in a reasonable computational time. Using interval arithmetic, coupled with the computational power of GPU, this method iteratively partitions the design space into many subregions and classifies these subregions as feasible, infeasible, and indeterminate regions. To visualize these classified regions in the design space, a planar visualization approach that projects all classified regions into one figure is also proposed. The GPU-based parallel region classification method and the planar visualization approach are validated through two case studies about the bird function and the welded beam design. These case studies show that the method and the approach can solve the continuous constraint satisfaction problems and visualize the results effectively and efficiently. A four-step procedure for implementing the method and the approach in practice is also outlined.
- 17 January 2023
- Published by Wiley in Journal of Mechanical Design
- Vol. 145 (5) , 1-47
Artificial Intelligence Impersonating a Human: The Impact of Design Facilitator Identity on Human Designers
Advances in artificial intelligence (AI) offer new opportunities for human–AI cooperation in engineering design. Human trust in AI is a crucial factor in ensuring an effective human–AI cooperation, and several approaches to enhance human trust in AI have been explored in prior studies. However, it remains an open question in engineering design whether human designers have more trust in an AI and achieve better joint performance when they are deceived into thinking they are working with another human designer. This research assesses the impact of design facilitator identity (“human” versus AI) on human designers through a human subjects study, where participants work with the same AI design facilitator and they can adopt their AI facilitator’s design anytime during the study. Half of the participants are told that they work with an AI, and the other half of the participants are told that they work with another human participant but in fact they work with the AI design facilitator. The results demonstrate that, for this study, human designers adopt their facilitator’s design less often on average when they are deceived about the identity of the AI design facilitator as another human designer. However, design facilitator identity does not have a significant impact on human designers’ average performance, perceived workload, and perceived competency and helpfulness of their design facilitator in the study. These results caution against deceiving human designers about the identity of an AI design facilitator in engineering design.
- 17 January 2023
- Published by Wiley in Journal of Mechanical Design
- Vol. 145 (5) , 1-47
Artificial Intelligence Impersonating a Human: The Impact of Design Facilitator Identity on Human Designers
Advances in artificial intelligence (AI) offer new opportunities for human–AI cooperation in engineering design. Human trust in AI is a crucial factor in ensuring an effective human–AI cooperation, and several approaches to enhance human trust in AI have been explored in prior studies. However, it remains an open question in engineering design whether human designers have more trust in an AI and achieve better joint performance when they are deceived into thinking they are working with another human designer. This research assesses the impact of design facilitator identity (“human” versus AI) on human designers through a human subjects study, where participants work with the same AI design facilitator and they can adopt their AI facilitator’s design anytime during the study. Half of the participants are told that they work with an AI, and the other half of the participants are told that they work with another human participant but in fact they work with the AI design facilitator. The results demonstrate that, for this study, human designers adopt their facilitator’s design less often on average when they are deceived about the identity of the AI design facilitator as another human designer. However, design facilitator identity does not have a significant impact on human designers’ average performance, perceived workload, and perceived competency and helpfulness of their design facilitator in the study. These results caution against deceiving human designers about the identity of an AI design facilitator in engineering design.
- Open Access
- 9 January 2023
- Published by Elsevier in Data in Brief
- Vol. 46, 108884
Data on human decision, feedback, and confidence during an artificial intelligence-assisted decision-making task
- 9 January 2023
- Published by Elsevier in Data in Brief
- Vol. 46, 108884
Open AccessData on human decision, feedback, and confidence during an artificial intelligence-assisted decision-making task
- Top Cited PapersOpen Access
- 20 October 2022
- Published by Elsevier in Computers in Human Behavior
- Vol. 139
Trust in an AI versus a Human teammate: The effects of teammate identity and performance on Human-AI cooperation
- 20 October 2022
- Published by Elsevier in Computers in Human Behavior
- Vol. 139
Top Cited PapersOpen AccessTrust in an AI versus a Human teammate: The effects of teammate identity and performance on Human-AI cooperation
- 3 June 2022
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 23 (2)
Reducing the Search Space for Global Minimum: A Focused Regions Identification Method for Least Squares Parameter Estimation in Nonlinear Models
Important for many science and engineering fields, meaningful nonlinear models result from fitting such models to data by estimating the value of each parameter in the model. Since parameters in nonlinear models often characterize a substance or a system (e.g., mass diffusivity), it is critical to find the optimal parameter estimators that minimize or maximize a chosen objective function. In practice, iterative local methods (e.g., Levenberg–Marquardt method) and heuristic methods (e.g., genetic algorithms) are commonly employed for least squares parameter estimation in nonlinear models. However, practitioners are not able to know whether the parameter estimators derived through these methods are the optimal parameter estimators that correspond to the global minimum of the squared error of the fit. In this paper, a focused regions identification method is introduced for least squares parameter estimation in nonlinear models. Using expected fitting accuracy and derivatives of the squared error of the fit, this method rules out the regions in parameter space where the optimal parameter estimators cannot exist. Practitioners are guaranteed to find the optimal parameter estimators through an exhaustive search in the remaining regions (i.e., focused regions). The focused regions identification method is validated through two case studies in which a model based on Newton’s law of cooling and the Michaelis–Menten model are fitted to two experimental data sets, respectively. These case studies show that the focused regions identification method can find the optimal parameter estimators and the corresponding global minimum effectively and efficiently.
- 3 June 2022
- Published by Wiley in Journal of Computing and Information Science in Engineering
- Vol. 23 (2)
Reducing the Search Space for Global Minimum: A Focused Regions Identification Method for Least Squares Parameter Estimation in Nonlinear Models
Important for many science and engineering fields, meaningful nonlinear models result from fitting such models to data by estimating the value of each parameter in the model. Since parameters in nonlinear models often characterize a substance or a system (e.g., mass diffusivity), it is critical to find the optimal parameter estimators that minimize or maximize a chosen objective function. In practice, iterative local methods (e.g., Levenberg–Marquardt method) and heuristic methods (e.g., genetic algorithms) are commonly employed for least squares parameter estimation in nonlinear models. However, practitioners are not able to know whether the parameter estimators derived through these methods are the optimal parameter estimators that correspond to the global minimum of the squared error of the fit. In this paper, a focused regions identification method is introduced for least squares parameter estimation in nonlinear models. Using expected fitting accuracy and derivatives of the squared error of the fit, this method rules out the regions in parameter space where the optimal parameter estimators cannot exist. Practitioners are guaranteed to find the optimal parameter estimators through an exhaustive search in the remaining regions (i.e., focused regions). The focused regions identification method is validated through two case studies in which a model based on Newton’s law of cooling and the Michaelis–Menten model are fitted to two experimental data sets, respectively. These case studies show that the focused regions identification method can find the optimal parameter estimators and the corresponding global minimum effectively and efficiently.
- Open Access
- 17 February 2022
- Published by Elsevier in Design Studies
- Vol. 79
Decoding the agility of artificial intelligence-assisted human design teams
- 17 February 2022
- Published by Elsevier in Design Studies
- Vol. 79
Open AccessDecoding the agility of artificial intelligence-assisted human design teams
- Top Cited PapersOpen Access
- 1 February 2022
- Published by Elsevier in Computers in Human Behavior
- Vol. 127
Human confidence in artificial intelligence and in themselves: The evolution and impact of confidence on adoption of AI advice
- 1 February 2022
- Published by Elsevier in Computers in Human Behavior
- Vol. 127
Top Cited PapersOpen AccessHuman confidence in artificial intelligence and in themselves: The evolution and impact of confidence on adoption of AI advice
- Open Access
- 16 July 2021
- Published by ASME International
An Initial Guess Free Method for Least Squares Parameter Estimation in Nonlinear Models
- 16 July 2021
- Published by ASME International
Open AccessAn Initial Guess Free Method for Least Squares Parameter Estimation in Nonlinear Models