Search Results - (( variables iteration method algorithm ) OR ( variable extractions using algorithm ))

Refine Results
  1. 1

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The LP’s application is need to be further computed with a technique and Simplex algorithm is the one that commonly used. The Simplex algorithm has three stages of computation namely initialization, iterative calculation and termination. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Adapting perturbation voltage for variable speed micro-hydro using particle swarm optimization (PSO) by Kit, Guan Lim, Mohd Izzat Fikri Md Zainal, Min, Keng Tan, Ahmad Razani Haron, Chang, Yii Chai, Teo, Kenneth Tze Kin

    Published 2022
    “…Results show that the value of perturbation speed affects the performance of MPPT algorithm to search the maximum operating point. Low perturbation signal requires many numbers of iteration before it reaches the steady state. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  3. 3
  4. 4

    Partial Newton methods for a system of equations by Goh, Bean San, Leong, Wah June, Siri, Zailan

    Published 2013
    “…This is because it uses only one or two variables instead of all the search variables in each iteration.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly by Mohd Suzaly, Muhammad Abu Syah

    Published 2023
    “…The next method is simplex method. The simplex method is a conceptual model approach for analysing linear programming problems with any number of variables. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Comparative study of modified BFGS and new scale modified BFGS for solving unconstrained optimization / Shahirah Atikah Mohamad Husnin by Mohamad Husnin, Shahirah Atikah

    Published 2018
    “…Broyden-Fletcher-Goldfarb-Shanno (BFGS) is one of a well-known Quasi-Newton update formula. This method is generally considered as the most efficient method among other variable metric methods for solving unconstrained optimization problems. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

    Model selection approaches of water quality index data by Kamarudin, Nur Azulia, Ismail, Suzilah

    Published 2016
    “…Automatic model selection by using algorithm can avoid huge variability in model specification process compared to manual selection.With the employment of algorithm, the right model selected is then also used for forecasting purposes. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

    Published 2025
    “…The model employs a two-level structure, where the first level uses standard soft constraints as the objective function to evaluate solution quality, while the second level dynamically adapts to faculty-specific preferences. A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin by Shamsudin, Siti Nur Hafiza

    Published 2019
    “…Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Existence and uniqueness for the evolutionary impulse control problem using an asynchronous algorithms by Haiour M., Bencheikh Le Hocine M.E.A., Jan R., Himadan A., Boulaaras S.

    Published 2025
    “…Our approach unfolds through a four-step methodology, leveraging distinctive features of a discrete iterative technique. This methodology integrates semi-implicit techniques with respect to the variable t and employs spatial approximation via finite element methods. …”
    Article
  14. 14

    Towards large scale unconstrained optimization by Abu Hassan, Malik

    Published 2007
    “…This method computes a Newton-type direction by truncating the conjugate Gradient method iterates (inner iterations) whenever a required accuracy is nobtained, thereby the superlinear convergence is guaranteed. …”
    Get full text
    Get full text
    Get full text
    Inaugural Lecture
  15. 15

    Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm by Nur Azulia, Kamarudin

    Published 2019
    “…Therefore, in this study SUREAutometrics is improvised using two MLE methods, which are iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm, named as SURE(IFGLS)-Autometrics and SURE(EM)-Autometrics algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    FPGA implementation of variable precision Euclid’s GCD algorithm by Al-Haija, Qasem Abu, Syed Ahmad Abdul Rahman, Sharifah Mumtazah, Alfarran, Islam

    Published 2017
    “…Methodology: In this paper, we implement a fast GCD coprocessor based on Euclid's method with variable precisions (32-bit to 1024-bit). …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Design of digital circuit structure based on evolutionary algorithm method by Chong, Kok Hen, Aris, Ishak, Bashi, Senan Mahmood, Koh, Johnny Siaw Paw

    Published 2008
    “…The proposed method is an iterative procedure that consists of a constant-size population of individuals, each one encoding a possible solution in a given problem space. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Scaled Conjugate Gradient using strong Wolfe line search for portfolio selection / Nurfatihah Anizan by Anizan, Nurfatihah

    Published 2024
    “…These methods are tested using 20 test functions with different variables also with four initial points have been for each variable. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Classification for large number of variables with two imbalanced groups by Ahmad Hakiim, Jamaluddin

    Published 2020
    “…This study proposed two algorithms of classification namely Algorithm 1 and Algorithm 2 which combine resampling, variable extraction, and classification procedure. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis