and a sub-optimization procedure to obtain a good R^n search direction in O (n log n) where n is the number of elements .(see the paper linked on the optm. page)
>>>> My Question is :
Can this algorithm extended to intervallar algerbra ?
Can a CG Optimizaiton Algorithm extended to intevallar
algebra ?
( The internal optimization procedure uses a
modified Global Coniugate Gradient minizing the
second order taylor envelope ... then if exists
an intervallar CG - optimization .... )
Thank
Centi Riccardo
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I have developed a local optimization algorithm
and a software that uses it :
============================
PAPER PAGE :
[ http://openddpt.sourceforge.net/index.php?startpage=optimization ]
BENCHMARK PAGE :
[ http://openddpt.sourceforge.net/index.php?startpage=benchmark ]
============================
The algorithms uses second order directional derivatives
for reducing computation complexity .
[ http://citeseer.ist.psu.edu/38221.html ]
and a sub-optimization procedure to obtain a good R^n search direction in O (n log n) where n is the number of elements .(see the paper linked on the optm. page)
>>>> My Question is :
Can this algorithm extended to intervallar algerbra ?
Can a CG Optimizaiton Algorithm extended to intevallar
algebra ?
( The internal optimization procedure uses a
modified Global Coniugate Gradient minizing the
second order taylor envelope ... then if exists
an intervallar CG - optimization .... )
Thank
Centi Riccardo
Hello centiped,
Maybe you should ask your question directly to the "Reliable Computing" list (mailto:reliable_computing@interval.louisiana.edu).
Cheers,
F.