GIFT with NURBS to model the geometry and PHT-splines to model the unknown solution
were applied to problems of linear elasticity and Laplace equation [24], bending of cracked
Kirchhoff-Love plates [25], and time-harmonic acoustics [23]. It was demonstrated that, the
adaptive local refinement of the solution can obtain optimal convergence rates in the cases
of solutions of reduced continuity. Additionally, Jansari et al. [26] developed the research
work of [23] by enriching the PHT-splines solution with the partition of unity property using
plane waves, showing in some cases that, the enrichment provides an enhancement of several
orders of magnitude in the overall solution error.
In the field of optimization, IGA formulations have been applied to many engineering ap-
plications, such as: structural shape optimization [27,28], composite structural optimization
[29], acoustic shape optimization [30], piezoelectric energy harvesters [31,32], thermal meta-
materials [33], heat conduction problems [34] and fluids [35] (for a comprehensive review, the
reader is referred to [36]). In addition to the better accuracy of IGA over FEM per degree
of freedom because of the NURBS higher order and higher continuity, IGA addresses an im-
portant issue in FEM shape optimization associated with the boundary representation and
the evolution of mesh following the changing boundary. In IGA, the set of control variables
that parameterize the boundary is naturally chosen as design variables, providing a tight
link between the design, analysis and optimization models. The same approach to shape
optimization is applicable in GIFT.
The optimization methods are classified in two families: gradient-free and gradient-based
methods. The family of gradient-free methods includes, for example, Particle Swarm Op-
timization (PSO) [37,38] implemented in shape optimization problems in [15,27], Genetic
Algorithm [39] and its optimization applications in [40], among others. The main advan-
tage of gradient-free methods is their ability to find global minimum without any sensitiv-
ity analysis, however, at a much higher computational cost than gradient-based methods.
Gradient-based methods [41,42] have much higher convergence rate, however, depending on
the initial guess, they may converge to a local minimum. The performance of gradient-based
optimization methods can be further improved by providing exact gradients, obtained from
the shape derivatives of the objective function, the weak form of the problem and constraints
to perform the sensitivity analysis [14,28]. However, in many applications shape derivatives
are difficult to obtain. In such case, gradients are calculated using finite-difference approx-
imations. This can be done efficiently for small and medium-size problems. In this work,
we use Sequential Quadratic Programming (SQP) algorithm, which is considered as one of
the most effective methods for solving nonlinear constraint optimization problems [43]. In
SPQ, the sequence of quadratic sub-problems is solved at each iteration to obtain the search
direction. The algorithm is efficiently implemented within Matlab $fmincon$function.
Combining shape optimization with adaptive refinement can be traced back to the 80’s.
For example, the works of Kikuchi et al. [44] and Canales et al. [45], are devoted to study
the shape optimization problems for linear elasticity using FEM and adaptive refinements.
Both works show that it is possible to achieve a process of automatic mesh generation and
shape optimization, while the main drawback is that the mesh is prone to distortion, which
is a usual problem with FE formulations. In a more recent work, Mohite and Upadhyay [46]
proposed an adaptive shape optimization framework for laminated composite plates, showing
the advantage of adaptive refinement over uniform refinement.
As pointed out by the review study from Upadhyay et al. [47], adaptive mesh refinement
3