[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"a9be5a4067925ca04018925302e61b3ebb4f4da7da3ac566cb9a62db36414fd3","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"6d19c215c0b832afefb88b1841f0997088eb6003cc819b4854496d32b00d096b","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"6d19c215c0b832afefb88b1841f0997088eb6003cc819b4854496d32b00d096b","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"69d22614b304ff404a11c5ae5fb24d49fe9899953e13878753c4506a3efdfb71","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"b74020b7093ab8ca3e30788932bffd44d029e2012501842fad847b5f492ed76d","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"c513b5a47fef749a95ccf774083087256d99e15cdd1a1a929570f20b61e946a3","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"1e7b7d120dbcd41709321ae78ebd0f3941e8baad743b4d8088e8e6fffbfdc839","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"8b475864e58ab6a30fa81c992d3e6f5b649de0cfe67800592f94866254c27bad","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"a2a8f3b1895a6d8607a7d509ab58fa49eb686b49e7949962f7fccfc40d5e6ab5","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"f0216880ae25efa2e66d2ba3ffe3c7d95e386cde7bb5dec035863ad8d0bb6562","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"531c12364bbbdc357c46a6488eb2f578981ab51ab7966c8ae440a6517c29c079","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"2999a5a48453e7d9c91dcde5d4ece59b5c19982b955fec7cd5ffc51cc4ce377b","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"1f06ba66650281eb56f59419a7c20665a28fded0327bc62b44d614e0ceadd8fb","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"e7aa8113c9c065ab73c7cd941ab71c6ba9e444d6cde8e8449bf58ca8dff46666","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"977bec0a48115d977b52789300c8fe3de8ee872e053423596d70fd61603f0bb1","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"99518d7e5f5271c7eaf0368c9972db3a3b0daf09931ee7f94f712c85c4429ba6","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"9c8f222c953090b6317cbcaf769c30744bd3c175e0ddcacb49796333e1afa065","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"f731a9bbb115139ab3f073ac95b9c830ed6e56461577c09e34487b87202ce807","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"43e35852f2f37f05b74a5bb5c6aa23d5877de0ce9b05b1e1254a6735d73d0743","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"c5aa9c93f273f11ab09daba37dc49f544e7bf4270636f152c74dcd944f322ae1","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"2d303bd13548df90ce7232f50b69f2ae9a1dc507473914f7fcb1ffb54c524ac5","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"170f289915bba08760dbd6cd6cc840e92afce31828168b10e5837aaa0d8ad1a8","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"ed867d8bc860cd95bd1cf9a21f8e865c20afd3cc3c6c6a794ccec0fec441cb61","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"6008b19a52221f5cadb0fee36fb73f8e551035585495f5a72c094ae2263afc93","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"f37e05b10030ad4081b942a1dcd5e22cc945c750a577317bd070b4d554ccf0d1","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"25011930c592293f337c163ea4c0e8a07fb94b7723ff4fe26e98d2cf1776b926","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"27ff99e271cc025869989c1640d9d0c912bfab3b94f724d058375a5f5cc9f316","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"fbbfb44d7eba9b879e7350a2d96c5255cb469e83dd8d1fada5030d2221d5776e","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"d0213398aca3960c2f17d63628cbc743b1bd1cb895de6d542047255fab71e4c5","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"d0754e5c19493bef252d4dafa1539f17a860fafcaf99e362b5695868658f2b88","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"f679a53c3ec6cd4d6ab8e3c383c12f5fe89821f49c417abba183d030355c350b","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"81149e5bd47317e5b047a07d8d3fd72ee910fb101bedfe6d45965fccb7191802","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"dd2448a8cf521f89de2224a4db1f6e5c0969f1c5134063c38c8ed87a46a805aa","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"3f6011f67066bcb95bb9b4945f87e41647b7c2c66cf8148136650cb28dcbad77","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"26f19cabb87916e33f530d8566186d108409729d2f5112ed69d28ef784e2c266","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"73a0ab0d14c58d3068496b65775da929da7bd0136912a449029aaa4dc2e361d6","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"6e7699f8625f9db6a49a3de26e4c15390ca5f60b63f5c2ad7ebd6d8ee67790b5","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"746ec8d749d15c14fbf08b26ddab88c0f7af262be3aee446caa2db1143acd3f6","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"750f6ebbb957ecdc228f83108d79a06c59e38b0f0f3a4cb87b0e34d81536da2a","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"ed1e9b919c7eeaded4c2b9fddaaf646e459ab989fd8dcee361ee29a4adb8a99f","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"cb316af1d30ff4c6ae6536c15bf7517e712dceb2013bc6a6637e5fdf50f17bb7","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"3062b8ae4a8b4a8bd3b84d958f2f8386248e3d1476499c8494045f526f3194af","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"6cc82abbc9ad439b1db3540b4cebce779a47311a31500a46cc59b532f7758f90","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"ef2074cb638e1ddd1d6bc4483f72d228a523a5968f0b9bf5588a2d65e2ef0efd","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"6cfa290813978abfbf44e8af9e6cd64b0b07273d088349b76b33afe1b90bfeb0","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"38b78bd5f027ae610e64801b1473f8e9ad6006f3dd89ae55bbf6a1ba5aaa1834","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"f312832aed697e0ef9ed413ee08ed40f5e1b1b44f6b58ba7b8ba0429a96dd73e","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"4503aa026419dfb765ad83727742026f18c88296054f6fe226e6bcfee967ec48","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"395269ea59db54de5e98103a07f85254f9db27ae1c7613c4131cd528211a261d","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"19da0e34490df5d4db26575ec05f732a30f1312ebba5b89c3899efd77bec19c3","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"aeda20811e15ccff8e74cbf701cee188de340b7a1d145f120b48366f0c96c887","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"1ba52d09c2d0356cc0965d05c1f3395f351a5b79a5dd5c913106c1a1f1c4bdc7","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"2f0d6cf8c426cfe7015950386045850837dc77e91fbaad633b3ae75a6131b835","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"68d815c6931d0adfdb8c6c7b8d3f8cff75a4e7262aa6ca90156c54897f7b9a29","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"561eb6af96e912a37e683bcdf0403ca79be19ab8f180e049e0cd658bb68ee6bc","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"fd12324018d7203c87a837a0de5e6c73058dab16e9513d2027234f4b6cb1c9e6","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"d57cbd4f5cf6176aa4cc8e6e21c27639496b44e07e0b97a572c7bf133a8f6c0d","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"762df5bfb129af054c362aa359b32f474a031ceea0499396d090c853bfe17252","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"07ae95f99d3ea01c4a07c9a3434d1977a0123632e7eb869497ea207961fb567f","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"46a8d2bec261b107ce334c6f2d3882c0159e39cd8f86e95464dcb11040a70268","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"c3ff214053156b1ab6f6c4f6d11566f5385258bbe52722767dbb2e2a4e726af7","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"d8a575a0cf80e82ade85d4be82edc5f3f0c1ce09a0a23cf32b3591b3ab8fc575","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"f322dbab0ae166f8728d8f6c35486e2ec673a23a96dfed049c2816c7f6661f0c","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"8311f375dcd979f02f7f06896cb9342c766aae93752883dd9f5b9ebfcaffd2b3","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"37b75c8ddfba0951bc2472966e39a2e93deb90538ba3aac73d194cae243ab74b","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"38b78bd5f027ae610e64801b1473f8e9ad6006f3dd89ae55bbf6a1ba5aaa1834","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"0f3204162609507e785c89df18674fb49a293200731d3cf25cc7c153f8c20b98","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"3d36ab1cf969e677899148b241f6d112e0b9ef8e23812e94c386ea167366d5a8","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"d2ceb53d47b87cd598496789d26e2595e9375c4d742ade593524bc04bf4cf549","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"d897083fe52fbab2c422ab471270d5d3a6fe01c93bcf77f6e5d974f792bbcdaa","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"d67268f44dafb8a0dbd1e13a1628b202d29832af2231544a4f96c9e291ab0251","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"40c6bbfde881b17a42259980fa8ddecc5894766f926f800694b179562429ba8b","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"bb35339d2e0e98bfa0c67a9bc8933e85a5a7a318703e848ffe7279de592a384d","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"16676265748e7c63f0c3d09e356819ec12aebc3f906013456252b6caa9da9d8c","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"586f35a0b994143760cfc4f6f274b8260cda0571124e9ce0d03efe39a1648a1c","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"25d923cef526612dfaba8c379e32eb2b56648446ed84bbc9166b73d851fbc1ce","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"5f7194c81d58ab782734494d7c98d4601befbbde43d0633bb4c3ec3e4cb86415","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"71dbc093de401ba20e1f04f36694598b8a25a7e9645482e5f320c870555741a0","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"5b4c280c6c508c59a254a6498d9113a90ffabb0b4b34e6affe1b19fb25422c22","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"58a294b661909b47443799de18a4e32eadaf6cb222d3d9eb3c30075a725e4af5","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"66ceaa70a7298157fca8f659797799ef9de61c5687102dfe97c2496171fcd359","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"6b65e565a10dff2691ac35422047079ea1bb3d97f96cff03149f1bf3c84ed206","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"53d9d43bdb07c79506ff3f4e4ce51e746c8658d84db4f9dd5cafe81a85586c16","course_id":"COMPSCI/ISYE/MATH 730","course_uid":"course_16b002cb61d416743661e65d","catalog_version_id":"5b7da97725da4496c5e7d3631b045c05865245daa6c930fed71ed98ee7988243","course_number":730,"subjects":["COMPSCI","ISYE","MATH"],"title":"NONLINEAR OPTIMIZATION II","description":"Theory and algorithms for nonlinearly constrained optimization. Relevant geometric concepts, including tangent and normal cones, theorems of the alternative, and separation results. Constraint qualifications. Geometric and algebraic expression of first-order optimality conditions. Second-order optimality conditions. Duality. Nonlinear  programming algorithms: merit functions and filters; interior-point, augmented Lagrangian, and sequential quadratic programming algorithms.","requirements_text":"STAT/​COMP SCI/​I SY E/​MATH  726"}]