Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Heuristics

Heuristics

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...

Lagrange Multipliers: Problem Solving

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...

Lagrange Multipliers: Two Constraints

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.

The Availability Heuristic

The Availability Heuristic

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):

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

You might also read

Related Articles

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

Sort by

Same author

Onychocryptosis: a retrospective study of clinical aspects, inflammation treatment and pain management using Ozoile as a hydrogel and cream formulation.

European journal of translational myology·2024

Same author

Emotion Measurements Through the Touch of Materials Surfaces.

Frontiers in human neuroscience·2020

Same author

Toward an optimal quantitative design method integrating user-centered qualitative attributes.

Food science & nutrition·2019

Same author

Robust structured controllers for piezoelectric microactuators.

ISA transactions·2014

Same author

Robust Design of Fuzzy Structured Controllers via a Moving Boundaries Process.

IEEE transactions on cybernetics·2014

Search research articles

Related Experiment Videos

Heuristic Kalman algorithm for solving optimization problems.

Rosario Toscano¹, Patrick Lyonnet

¹Laboratoire de Tribologie et de Dynamique des Systèmes, Ecole Nationale d'Ingénieurs de Saint-Etienne, Saint-Etienne Cedex 2, France.

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|April 2, 2009

Summary

This summary is machine-generated.

A new heuristic Kalman algorithm (HKA) offers a viable approach for solving continuous nonconvex optimization problems. This method shows strong potential, improving computation time and success rates compared to other metaheuristics.

Related Experiment Videos

Area of Science:

Computational Mathematics
Optimization Theory

Background:

Continuous nonconvex optimization problems are challenging.
Existing metaheuristics may have limitations in efficiency.

Purpose of the Study:

Introduce a novel optimization approach: the heuristic Kalman algorithm (HKA).
Evaluate HKA's effectiveness for continuous nonconvex optimization.

Main Methods:

Framing optimization as a measurement process to estimate the optimum.
Developing a Kalman-filter-based procedure to enhance estimate quality.
Testing HKA on unconstrained and constrained nonconvex problems.

Main Results:

HKA demonstrated significant potential in solving nonconvex optimization problems.
Numerical experiments showed improvements in computation time.
HKA achieved a high success ratio compared to other metaheuristics.

Conclusions:

The heuristic Kalman algorithm is a promising method for continuous nonconvex optimization.
HKA offers advantages in efficiency and success rate.
Further research into HKA's capabilities is warranted.