| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Estadual Campinas, IMECC UNICAMP, Dept Appl Math, BR-13081970 Campinas, SP - Brazil
[2] Inst Pasteur, Paris - France
[3] Univ Estadual Campinas, Inst Chem, BR-13081970 Campinas, SP - Brazil
[4] Itau Bank, Sao Paulo - Brazil
Total Affiliations: 4
|
| Document type: | Journal article |
| Source: | Journal of Global Optimization; v. 43, n. 1, p. 1-22, JAN 2009. |
| Web of Science Citations: | 10 |
| Abstract | |
Given r real functions F (1)(x),...,F (r) (x) and an integer p between 1 and r, the Low Order-Value Optimization problem (LOVO) consists of minimizing the sum of the functions that take the p smaller values. If (y (1),...,y (r) ) is a vector of data and T(x, t (i) ) is the predicted value of the observation i with the parameters , it is natural to define F (i) (x) = (T(x, t (i) ) - y (i) )2 (the quadratic error in observation i under the parameters x). When p = r this LOVO problem coincides with the classical nonlinear least-squares problem. However, the interesting situation is when p is smaller than r. In that case, the solution of LOVO allows one to discard the influence of an estimated number of outliers. Thus, the LOVO problem is an interesting tool for robust estimation of parameters of nonlinear models. When p << r the LOVO problem may be used to find hidden structures in data sets. One of the most successful applications includes the Protein Alignment problem. Fully documented algorithms for this application are available at www.ime.unicamp.br/martinez/lovoalign. In this paper optimality conditions are discussed, algorithms for solving the LOVO problem are introduced and convergence theorems are proved. Finally, numerical experiments are presented. (AU) | |
| FAPESP's process: | 06/53768-0 - Computational methods of optimization |
| Grantee: | José Mário Martinez Perez |
| Support Opportunities: | Research Projects - Thematic Grants |