Results of two global optimization algorithms applied to a problem in biomechanics

Authors:
Nicholas R. Radcliffe;David R. Easterling;Layne T. Watson;Michael L. Madigan;Kathleen A. Bieryla
Affiliations:
Virginia Polytechnic Institute and State University Blacksburg, Virginia;Virginia Polytechnic Institute and State University Blacksburg, Virginia;Virginia Polytechnic Institute and State University Blacksburg, Virginia;Virginia Polytechnic Institute and State University Blacksburg, Virginia;Bucknell University, Lewisburg, Pennsylvania
Venue:
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Year:
2010

Citing 3
Cited 3

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
Algorithm 897: VTDIRECT95: Serial and parallel codes for the global optimization algorithm direct

ACM Transactions on Mathematical Software (TOMS)

Direct search versus simulated annealing on two high dimensional problems

Proceedings of the 19th High Performance Computing Symposia
Direct search and stochastic optimization applied to two nonconvex nonsmooth problems

Proceedings of the 2012 Symposium on High Performance Computing
Parallel deterministic and stochastic global minimization of functions with very many minima

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The results of two global optimization algorithms applied to an optimization problem in biomechanics are presented. Of interest is the discovery of the minimum value of an objective function derived from certain performance criteria related to a problem in biomechanics---specifically, a biomedical application called perturbation-based balance training (PBBT). PBBT is a method for improving balance through repeated exposure to postural perturbations. A parallel implementations of Spall's algorithm and a parallel implementation of the DIRECT (DIviding RECTangles) algorithm is applied to this optimization problem.