A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
Visualitza/Obre
Cita com:
hdl:2117/132581
Tipus de documentArticle
Data publicació2017-11
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
The problem (LFP) of finding a feasible solution to a given linear
semi-infinite system arises in different contexts. This paper provides
an empirical comparative study of relaxation algorithms for (LFP).
In this study we consider, together with the classical algorithm, imple-
mented with different values of the fixed parameter (the step size), a
new relaxation algorithm with random parameter which outperforms
the classical one in most test problems whatever fixed parameter is
taken. This new algorithm converges geometrically to a feasible so-
lution under mild conditions. The relaxation algorithms under com-
parison have been implemented using the Extended Cutting Angle
Method (ECAM) for solving the global optimization subproblems.
CitacióFerrer, A. [et al.]. A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem. "Annals of operations research", Novembre 2017, vol. 258, núm. 2, p. 587-612.
ISSN0254-5330
Col·leccions
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
A_comparative_note.pdf | 526,9Kb | Visualitza/Obre |