From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,e6c338b74ca219bb,start
X-Google-Attributes: gid103376,public
From: Jean Claude Berges <Jean-Claude.Berges@CST.CNES.FR>
Subject: Optimisation Ada software ?
Date: 1996/06/25
Message-ID: <9606250701.AA06105@aquarels.cst.cnes.fr>#1/1
X-Deja-AN: 161994234
sender: Ada programming language <INFO-ADA@LISTSERV.NODAK.EDU>
comments: Gated by NETNEWS@AUVM.AMERICAN.EDU
newsgroups: comp.lang.ada
Date: 1996-06-25T00:00:00+00:00
List-Id: <comp.lang.ada>


I am looking for an Ada procedure which
realizes the minimisation of the quadratic criterion
C= Q(S) by optimising the elements of E.

E and S are vectors of floats, and are linked by
the relation S=function_F(E);

Fonction_F is coded in Ada. It is non-linear, not continuous,
but quite regular. Whe hope there is no local minima. Speed of
variations might be very different on the different axes.

Speed of convergence must be high, precision is not critical.

Please make a copy of your answer to serge@lune.cst.cnes.fr

Thanks a lot.

Serge Potteck