BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Asia/Karachi
BEGIN:STANDARD
DTSTART:20091031T230000
TZOFFSETFROM:+0600
TZOFFSETTO:+0500
TZNAME:PKT
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20221024T171907Z
UID:D43F11B6-44EB-4895-B8F0-0F652D1092A3
DTSTART;TZID=Asia/Karachi:20221013T150000
DTEND;TZID=Asia/Karachi:20221013T160000
DESCRIPTION:Sequential Quadratic Programming (SQP) is a very common techniq
 ue to solve nonlinear optimization problems. Firstly\, SQP converts nonlin
 ear problems into linear problems and then uses sub-quadratic concepts to 
 optimize the linear problem. SQP follows iterative procedure in which a pr
 oblem is solved for the current iteration and then the current solution is
  used to construct a new iteration. This construction is done in such a wa
 y the sequence converges to the local minima.\n\nCo-sponsored by: Control 
 and Signal Processing Research Group \n\nSpeaker(s): Mr. Ahmad Mahmood Mug
 hal\, \n\nCapital University of Science & Technology (CUST)\, Islamabad\, 
 Islamabad Capital Territory\, Pakistan
LOCATION:Capital University of Science & Technology (CUST)\, Islamabad\, Is
 lamabad Capital Territory\, Pakistan
ORGANIZER:gm@pieas.edu.pk
SEQUENCE:0
SUMMARY:Introduction to Sequential Quadratic Programming
URL;VALUE=URI:https://events.vtools.ieee.org/m/329316
X-ALT-DESC:Description: <br /><p>Sequential Quadratic Programming (SQP) is 
 a very common technique to solve nonlinear optimization problems. Firstly\
 , SQP converts nonlinear problems into linear problems and then uses sub-q
 uadratic concepts to optimize the linear problem.&nbsp\; SQP follows itera
 tive procedure in which a problem is solved for the current iteration and 
 then the current solution is used to construct a new iteration. This const
 ruction is done in such a way the sequence converges to the local minima.<
 /p>
END:VEVENT
END:VCALENDAR