<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html; charset=ISO-8859-15"
http-equiv="Content-Type">
<title></title>
</head>
<body bgcolor="#ffffff" text="#000000">
I am not sure from you message below, but perhaps your problem is
similar to the example<br>
<a class="moz-txt-link-freetext" href="http://www.coin-or.org/CppAD/Doc/ipopt_ode_problem.xml">http://www.coin-or.org/CppAD/Doc/ipopt_ode_problem.xml</a><br>
<br>
On 1/13/2010 2:27 AM, Arturo Padilla wrote:
<blockquote
cite="mid:1786810664.25030.1263378457589.JavaMail.root@group"
type="cite">
<pre wrap="">Hi everybody,
I have successfully used IPOPT with orthogonal collocation through AMPL for a parameter identification problem. I need to repeat this computation but now only using c++, I would like to perform an online parameter identification. Could anybody give me some hints how to proceed. Another alternative for me would be to used forward euler instead of orthogonal collocation in order to solve the differential equation of the objective function. But I have then another problem, I can not compute the gradient of the objective function. Without it, it is not possible to perform the optimization, isn't it?
Thank you in advance.
Greetings,
Arturo Padilla
</pre>
<pre wrap="">
<fieldset class="mimeAttachmentHeader"></fieldset>
_______________________________________________
Ipopt mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Ipopt@list.coin-or.org">Ipopt@list.coin-or.org</a>
<a class="moz-txt-link-freetext" href="http://list.coin-or.org/mailman/listinfo/ipopt">http://list.coin-or.org/mailman/listinfo/ipopt</a>
</pre>
</blockquote>
<br>
</body>
</html>