Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Trial and Error and Algorithm01:12

Trial and Error and Algorithm

398
A problem-solving strategy is a plan of action used to find a solution. Different strategies have distinct action plans. Trial and error involves trying different solutions until one works. For instance, to fix a broken printer, you might check ink levels, ensure the paper tray isn't jammed, and verify the printer's connection to your laptop. This method can be time-consuming but is commonly used. Thomas Edison, for example, used trial and error to find a suitable filament for the light...
398
The Availability Heuristic01:08

The Availability Heuristic

6.9K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
6.9K
The Representativeness Heuristic02:13

The Representativeness Heuristic

16.7K
The representative heuristic describes a biased way of thinking, in which you unintentionally stereotype someone or something. For example, you may assume that your professors spend their free time reading books and engaging in intellectual conversation, because the idea of them spending their time playing volleyball or visiting an amusement park does not fit in with your stereotypes of professors.
16.7K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

295
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
295
The Anchoring-and-Adjustment Heuristic01:25

The Anchoring-and-Adjustment Heuristic

7.7K
In order to make good decisions, we use our knowledge and our reasoning. Often, this knowledge and reasoning is sound and solid. However, sometimes, we are swayed by biases or by others manipulating a situation. For example, let’s say you and three friends wanted to rent a house and had a combined target budget of $1,600. The realtor shows you only very run-down houses for $1,600 and then shows you a very nice house for $2,000. Might you ask each person to pay more in rent to get the...
7.7K
Heuristics01:21

Heuristics

668
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
668

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Transforming multi-omics data into images for disease classification: A review of techniques and tools.

Journal of pathology informatics·2026
Same author

AI-powered prediction of HCC recurrence after surgical resection: Personalised intervention opportunities using patient-specific risk factors.

Liver international : official journal of the International Association for the Study of the Liver·2024
Same author

Identification of cancer risk groups through multi-omics integration using autoencoder and tensor analysis.

Scientific reports·2024
Same author

EV-LFV: Synthesizing Light Field Event Streams from an Event Camera and Multiple RGB Cameras.

IEEE transactions on visualization and computer graphics·2023
Same author

A secure routing approach based on league championship algorithm for wireless body sensor networks in healthcare.

PloS one·2023
Same author

Pan-Cancer Analysis Reveals Functional Similarity of Three lncRNAs across Multiple Tumors.

International journal of molecular sciences·2023
Same journal

Relaxed Stability Conditions for Model Predictive Control of Hybrid Dynamical Systems Using Hybrid Recurrent Neural Networks.

IEEE transactions on cybernetics·2026
Same journal

An Evolutionary Algorithm Assisted by an Ensemble of Pareto-Optimal Surrogate Models.

IEEE transactions on cybernetics·2026
Same journal

A Quantum Self-Attention Neural Network Model on Quantum Circuits.

IEEE transactions on cybernetics·2026
Same journal

Semi-Explicit Solution of Some Discrete-Time Higher-Order-Cost Mean-Field-Type Control.

IEEE transactions on cybernetics·2026
Same journal

A Novel One-Step Small Object Detector for Autonomous Aerial Vehicles.

IEEE transactions on cybernetics·2026
Same journal

Online Data-Driven-Based Optimal Output Tracking Control Without Initial Stabilizing Policy.

IEEE transactions on cybernetics·2026
See all related articles

Related Experiment Video

Updated: Jan 20, 2026

Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm
06:53

Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm

Published on: July 23, 2020

6.1K

Stochastic Dual Simplex Algorithm: A Novel Heuristic Optimization Algorithm.

Seid Miad Zandavi, Vera Yuk Ying Chung, Ali Anaissi

    IEEE Transactions on Cybernetics
    |August 20, 2019
    PubMed
    Summary
    This summary is machine-generated.

    A novel stochastic dual simplex algorithm (SDSA) offers a competitive approach for nonlinear optimization problems. This heuristic method uses distributed simplexes to efficiently find optimal solutions, outperforming existing algorithms in accuracy and complexity.

    More Related Videos

    Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
    07:15

    Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

    Published on: August 16, 2020

    7.4K
    Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
    07:05

    Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

    Published on: February 15, 2022

    2.9K

    Related Experiment Videos

    Last Updated: Jan 20, 2026

    Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm
    06:53

    Management of Respiratory Motion Artefacts in 18F-fluorodeoxyglucose Positron Emission Tomography using an Amplitude-Based Optimal Respiratory Gating Algorithm

    Published on: July 23, 2020

    6.1K
    Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model
    07:15

    Machine Learning Algorithms for Early Detection of Bone Metastases in an Experimental Rat Model

    Published on: August 16, 2020

    7.4K
    Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
    07:05

    Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

    Published on: February 15, 2022

    2.9K

    Area of Science:

    • Optimization Algorithms
    • Numerical Analysis
    • Computational Mathematics

    Background:

    • Nonlinear optimization problems present significant challenges in various scientific and engineering fields.
    • Existing heuristic algorithms often face limitations in convergence speed and solution accuracy.
    • Simplex-based techniques offer a geometric approach to exploring search spaces.

    Purpose of the Study:

    • To introduce a new heuristic optimization algorithm for solving nonlinear optimization problems.
    • To enhance the efficiency and accuracy of finding optimal solutions using stochastic methods.
    • To evaluate the performance of the proposed algorithm against established optimization techniques.

    Main Methods:

    • Development of the stochastic dual simplex algorithm (SDSA).
    • Utilizing a stochastic distribution of dual simplexes within the search space.
    • Implementing a mechanism for simplexes to share vertex information to improve movement.
    • Application to 25 well-known benchmark nonlinear optimization problems.

    Main Results:

    • The stochastic dual simplex algorithm (SDSA) demonstrated competitive performance.
    • Comparative analysis showed comparable or superior results in terms of accuracy.
    • The algorithm exhibited favorable complexity compared to other methods.
    • SDSA proved effective across a range of benchmark problems.

    Conclusions:

    • The proposed stochastic dual simplex algorithm (SDSA) is a viable and effective method for nonlinear optimization.
    • SDSA offers a promising alternative to existing algorithms, balancing accuracy and computational complexity.
    • Further research can explore hybridizations and applications of SDSA in complex real-world scenarios.