Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
Repository logo
  • Communities & Collections
  • All of DSpace
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Kumar, Nitish"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    Multiple Quantum Well-based AlGaN/GaN MOS-HEMTs with Stacked-Gate Dielectric Engineering for High-Power and High- Frequency Applications
    (National Institute of Technology, Silchar, 2026) Kumar, Nitish
  • Loading...
    Thumbnail Image
    Item
    Quadratic Approximation based GA for Function Optimization
    (Department of Mathematics, NITS, 2025) Kumar, Nitish
    This thesis presents an enhanced Genetic Algorithm (GA) framework utilizing Quadratic Approximation (QA) to solve both constrained and unconstrained optimization problems more efficiently. The primary objective is to obtain better fitness values by accelerating convergence and improving solution accuracy. In the proposed approach, a local quadratic approximation is integrated into the GA to refine solutions, thus balancing global exploration and local exploitation. To evaluate the effectiveness of the proposed QA-based GA (QA-GA), extensive experiments were conducted on standard benchmark functions, including Sphere, Rastrigin, and Ackley functions, among others. The performance of the QA-GA was systematically compared with the classical GA in terms of convergence speed and optimal solution quality. Experimental results indicate that QA-GA consistently outperforms the traditional GA by converging faster and locating better global optima across various test cases. The findings confirm that the integration of quadratic approximation significantly enhances the search capability of GA, making QA-GA a robust approach for complex optimization tasks.

DSpace software copyright © 2002-2026 LYRASIS

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback