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

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

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

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

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

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...

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.

You might also read

Related Articles

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

Sort by

Same author

Adaptive Multioutput Gradient RBF Tracker for Nonlinear and Nonstationary Regression.

IEEE transactions on cybernetics·2023

Same author

Deep Cascade Gradient RBF Networks With Output-Relevant Feature Extraction and Adaptation for Nonlinear and Nonstationary Processes.

IEEE transactions on cybernetics·2022

Same author

Multi-Output Selective Ensemble Identification of Nonlinear and Nonstationary Industrial Processes.

IEEE transactions on neural networks and learning systems·2020

Same author

Characterization of extended-spectrum β-lactamases (ESBLs)-producing Salmonella in retail raw chicken carcasses.

International journal of food microbiology·2017

Same author

Sclareolide enhances gemcitabine‑induced cell death through mediating the NICD and Gli1 pathways in gemcitabine‑resistant human pancreatic cancer.

Molecular medicine reports·2017

Same author

Improving the reversibility of thermal denaturation and catalytic efficiency of Bacillus licheniformis α-amylase through stabilizing a long loop in domain B.

PloS one·2017

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

Search research articles

Related Experiment Videos

A-optimality orthogonal forward regression algorithm using branch and bound.

Xia Hong¹, Sheng Chen, Chris J Harris

¹School of Systems Engineering, University of Reading, Reading RG661Y, UK. x.hong@reading.ac.uk

IEEE Transactions on Neural Networks

|November 13, 2008

Summary

This summary is machine-generated.

We introduce an Orthogonal Forward Regression (OFR) algorithm using branch and bound and A-optimality. This method efficiently selects optimal regressors, significantly reducing computational costs for model structure determination.

Related Experiment Videos

Area of Science:

Statistics
Machine Learning
Experimental Design

Background:

Orthogonal Forward Regression (OFR) is a method for selecting regressors in statistical models.
A-optimality experimental design aims to minimize the variance of parameter estimates.
Branch and Bound (BB) is an algorithm design paradigm for discrete and combinatorial optimization problems.

Purpose of the Study:

To propose a novel Orthogonal Forward Regression (OFR) algorithm.
To integrate Branch and Bound (BB) principles with A-optimality for efficient model selection.
To reduce the computational cost associated with A-optimality OFR algorithms.

Main Methods:

The proposed algorithm evaluates candidate regressors at each forward regression step.
It employs three decisions: include, defer, or permanently eliminate regressors.
An adaptive diagnostics test, combined with BB and A-optimality, determines elimination boundaries.

Main Results:

The algorithm significantly reduces computational cost in A-optimality OFR.
Numerical examples demonstrate the effectiveness of the proposed method.
It provides an efficient approach for model structure determination.

Conclusions:

The developed OFR algorithm offers a computationally efficient solution for model selection.
It successfully combines BB principles with A-optimality for enhanced performance.
The adaptive diagnostics test is key to reducing computational burden.