Converting Constrained Optimization to Unconstrained Optimization Using the Penalty Method

In this video we show how to convert a constrained optimization problem into an approximately equivalent unconstrained optimization problem using the penalty method. Topics and timestamps: 0:00 – Introduction 3:00 – Equality constrained only problem 12:50 – Reformulate as approximate unconstrained problem 34:59 – Penalty functions for inequality constraints Lecture notes and code can be downloaded from https://github.com/clum/YouTube/tree/main/Optimization09 References: -Fiacco, Anothny V. and McCormick, Garth P., “Nonlinear Programming: Sequential Unconstrained Minimization Techniques,” Wiley, 1968. -Jensen, Paul A. and Bard, Jonathan F., “Operations Research Models and Methods,” John Wiley & Sons, 2003 https://www.me.utexas.edu/~jensen/ORMM/ https://www.me.utexas.edu/~jensen/ORMM/supplements/units/nlp_methods/const_opt.pdf All Optimization videos in a single playlist (https://www.youtube.com/playlist?list=PLxdnSsBqCrrHo2EYb_sMctU959D-iPybT) #optimization You can support this channel via Patreon at https://www.patreon.com/christopherwlum or by clicking on the ‘Thanks’ button underneath the video. Thank you for your help!