CAST10 Archives

April 2018

CAST10@LISTSERV.UMD.EDU

Options: Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
MIME-Version:
1.0
Sender:
"Chemical Engineers in Computing and Systems Technology, AIChE" <[log in to unmask]>
Subject:
From:
John Hedengren <[log in to unmask]>
Date:
Wed, 11 Apr 2018 14:02:21 +0000
Content-Transfer-Encoding:
quoted-printable
Content-Type:
text/plain; charset="us-ascii"
Reply-To:
John Hedengren <[log in to unmask]>
Parts/Attachments:
text/plain (27 lines)
Erdal Aydin of the Max Planck Institute for Dynamics of Complex Technical Systems will deliver a CAST webinar on April 17 at 11 AM Eastern time.

Tailored Indirect Algorithms for Efficient On-line Optimization

Abstract: The trend toward high-quality, low-volume and high-added value production has put more emphasis on batch and semi-batch processing due to its increased flexibility of operations. Nonlinear model predictive control (NMPC) is an important tool for the real-time optimization of batch and semi-batch processes under uncertainty. However, the fact that the transient behaviour as well as the flexibility decrease with respect to time leads to very challenging optimization problems. The preferred strategy to solve constrained nonlinear dynamic optimization problems associated with the NMPC for these processes is usually to use a socalled direct method. Nevertheless, based on the problem type at hand and the solution algorithm used, direct methods may lead to computational complexity. In particular, the large prediction horizons required in the NMPC of batch and semi-batch processes increase the realtime computational effort because of expensive matrix factorizations in the solution steps, especially at the beginning of the batch. Alternatively, indirect methods based on Pontryagin's Minimum Principle (PMP) could efficiently deal with the optimization of batch and semi-batch processes. In fact, the interplay between states and co-states in the context of PMP might turn out to be computationally quite efficient. It has been extensively argued that indirect methods are usually non-convergent and inefficient for constrained problems. In this talk, we demonstrate how indirect solution techniques can be tailored to be convergent and effective for the dynamic optimization and NMPC for batch and semi-batch processes.
 
Biography:  Erdal Aydin is a scientific employee/doktorand at the Max Planck Institute for Dynamics of Complex Technical Systems. In his Ph.D time, Erdal is supervised by Prof. Kai Sundmacher and Prof. Dominique Bonvin from EPFL. He holds a BS diploma in Chemical Engineering from METU and an MS diploma in Chemical and Biological Engineering from Koc University. His research interests are in the areas of nonlinear dynamic optimization, model-based control, process optimization, real-time optimization and numerical methods. 

Please see the full announcement at the link below.

http://apmonitor.com/wiki/uploads/Main/2018_Erdal_Aydin.pdf

You can now join from a web-browser with no need to install a WebEx plugin. Click the link to join the webinar session:

https://byuweb.my.webex.com/byuweb.my/j.php?MTID=mecb9f974ec3f1de227cc2b14b0382cc8

There is a limit of 200 participants and there is no registration requirement. Please mute your microphone upon entering the meeting. A chat window is available for asking questions during or after the webinar presentation.

Best regards,

John Hedengren
Associate Professor
Brigham Young University
Provo, UT 84602
+1 801 477 7341
http://apm.byu.edu/prism 

ATOM RSS1 RSS2