Format

Send to

Choose Destination
See comment in PubMed Commons below
Biol Cybern. 2011 Feb;104(1-2):75-93. doi: 10.1007/s00422-011-0421-2. Epub 2011 Feb 11.

Analytical and numerical analysis of inverse optimization problems: conditions of uniqueness and computational methods.

Author information

1
Institut des Systèmes Intelligents et de Robotique, Université Pierre et Marie Curie-Paris, CNRS UMR, France. avterekhov@gmail.com

Abstract

One of the key problems of motor control is the redundancy problem, in particular how the central nervous system (CNS) chooses an action out of infinitely many possible. A promising way to address this question is to assume that the choice is made based on optimization of a certain cost function. A number of cost functions have been proposed in the literature to explain performance in different motor tasks: from force sharing in grasping to path planning in walking. However, the problem of uniqueness of the cost function(s) was not addressed until recently. In this article, we analyze two methods of finding additive cost functions in inverse optimization problems with linear constraints, so-called linear-additive inverse optimization problems. These methods are based on the Uniqueness Theorem for inverse optimization problems that we proved recently (Terekhov et al., J Math Biol 61(3):423-453, 2010). Using synthetic data, we show that both methods allow for determining the cost function. We analyze the influence of noise on the both methods. Finally, we show how a violation of the conditions of the Uniqueness Theorem may lead to incorrect solutions of the inverse optimization problem.

PMID:
21311907
PMCID:
PMC3098747
DOI:
10.1007/s00422-011-0421-2
[Indexed for MEDLINE]
Free PMC Article
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Springer Icon for PubMed Central
    Loading ...
    Support Center