[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"2cded20424b2cdbd9eef5df3d1748449ed795e9f579f718322e9908956d06b21","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"2cded20424b2cdbd9eef5df3d1748449ed795e9f579f718322e9908956d06b21","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"997cf11c559988a891eb7e40c6df3bbbfe4793508abafd1a4090949512ea1792","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"997cf11c559988a891eb7e40c6df3bbbfe4793508abafd1a4090949512ea1792","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"68cdff31c57e41b0804d38835fe225350c5922b0d1fe5e2cb25167d5347d478a","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"2e1c4f09820bea1e5dd1dd5136c99a2a36ff622d9f3eeb185475c4f84baf5c3a","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"4822e7470fcca08ec8b06dbb7aa76de1c8730ca5df74857f07241137f5035eee","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"5bcfbb152aeacf7da351c7b7729685d6f2557d83ada6bacaa4d74da2f8917f39","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"e4da3d1a1364114c5bdc39dc5e1ca4438ba711a283a0fbc7b2ef5e576bd6a0ff","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"c341e68fcf351ad0c71e65ffca75413c7d770e6a0315db50d26f5600b18205e7","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"43799dfc14d4dbab7e4dc0b70a2878740962073cce331dbee08a78c31ac513c5","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"146f9dcf95892f5fc4515d3a129af402c9d88006f28f3ae0e18718dc1d3f2ebd","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"8b9a3d1e8caf696ee916a10f8c9d00bce31ce6d027d02f046bc9916b5d2c467a","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"8525c575e01bc56e1886617ac6bb60c94ba766990e07f5f4ad8e6c65e633dc7c","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"46db28efc23d3594c74e9a1624526b8fdfdcbd3e85da006df2a2d919b7a9e88a","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"af9b4e4ef47a3208d0f52cb86e45f6193578794132d04f0938b08d65cc7ad3f0","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"5c13e51d72e5016362b0019e3d95a3c8958cd478f050a02f8d798f95c526588d","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"ca6314242e486d1ce02d74fb0d2eee57cc0bf9b05e06f75af6cff657a7e84454","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"cbe1cec749668ba37ad928d93987e8cb1ad8789c04704a697f47b720acfd706c","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"c49367fe9ff129976a703fa4d6bc659b9fcedb40c61b742ea8e36ce19f99bb2e","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"0448d9b0ae2c518d41381667299547e47cfe4d6f1d143d303b1f8c1244b1f8c2","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"662d660bae4b898089b5e3ff731b4eeb6793ed55aa04b3f2af57f615f4b0cebe","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"99072b803fdda2daf75e5b55d28713ffda65d07dab5d3d2e375408723baf048f","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"64b5e03512f1186c7fd57ddc2934b27549e68ec38c54f7a399dfad3317fb2765","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"3180608eaf38a976f1289860b9c4382589a9024d48ee79b0b664e3a5e2448766","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"58834111427a0610a107048153fbaf50d1ba207553d7927e04f17150a2290f9d","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"02002c00b06f6301e1054c7c5bf6fce6d0951190f6d33415a13ea107af3388d6","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"4eff26fa47c9de620a5610f9a625cab25f680274b9ba3f2518964f2a42a309c3","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"51c0be063e2830975e66e572eee1693276cb9b223b4dc765fb4af0a930bafbfe","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"21baacb4a0c4ce7b2062d6ad59820364da4a259f6c42a6555fc27416db130557","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"96ae9a51d58d2e5f6c568419fea259dc7d03639cac0e46aa175a33cd63415584","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"28bdd5716b449f20327b109ee8c02c0fbbbd380c9a435c7671b99f358928375d","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"ea9b8d3a82afb480114efdbde518aa4a73fc225d71d2f69c992c9dd8f5817b12","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"31c501c13c11e106a73c9f53d35ebdefa2bca0e76a313369c8c85ae1253da015","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"852f78b48a517d9dc1ad2ef9a102f4b4200adde944a4318afe2b886348402fe6","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"eea54b23a5387bbab8be19cb92bc05741c03288d993f767c69b840934c14bcbd","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"651b58fcfd30619014732c4864937bd3c980ff95a6fd8797f2e96bb1288ba1ff","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"ea4f7c6760a2c6cf53f8f8e1a1689d863495b3b023b4a5eb02b4c02ef4d5e341","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"8fb73f7d3ea080964448e5b885604d537a23675c9f35787f94e20f15e23f8c6c","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"f8d859a477f44cc2a14c8f90e398e557a505b282ec356caba281298f6318161f","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"db3fa4411836e7879f3e234216c3d4f0d729e37a3a9e52b96a87f61a901dc3a7","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"03d3413b2c318633303dbe8ee195b73d12ce2b24cc33319c3f1055683fa7a026","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"29e9604f0224dc1395bbdba1bf3c3a10482f0363f28aa629c873438459d61f43","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"8c7cb5e3d8ad5a9e51f969a633f931f30c30585aa2d4cfeda670986e25f89291","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"dbc945bdbf18b23ff1405f8e742a89fb2b7696f3f4b3a2b81865904498dd5661","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"945aa30207532731c8629ffefb6a73f6281bb061d765ecfc1fccb67259225e9c","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"6d4a65e92785f61e102599d8c81b756066080e408b0f143530862d387190ca03","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"345b51078031c49e429e774c2869de09b56106b68514a4f757aabf3c2624bab6","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"9a04984088d3551a6321f45ca535c6b89e022145651ad93d84ff497571503bcb","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"fdf2514064082a4c1b1f72fc64e1632489e91a179b7110106fc34f4f66206459","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"61b930471c69118018ba6fefb0dff894d17d2fc6adc28da625cbf6a692d10817","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"b0685b8459b52c515634c1cc663bfe9519e2ae2f26ddee3b5b745ffa664385cc","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"80da2b4455ad712c08724a7ec512e193413f53af75e010336773ab6a8d708219","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"9424ce552bbecafd6baee1e6fb25fecdcfd6a7cd6290d74e3282e87a9d5d5e02","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"e0c9ebf8cf60da08388998efc1cb6222eace6d3782ce1eb5cc4f55e00e77d076","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"b10ec146a7034582198c271551d3f6fbeca15124c47340a7e1c7cc73b1a47edd","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"06cf1b52c48449257f2176252909c9d241d4cb56ee7f3a6f0b4e2f685246741a","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"c7eddf5b30820818f8c4ddd4f68d61a4ee5d27931265d2b7da4feeb61eea1e0b","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"f08086426a56c913d679908334da653af9c28121ffea767be38c26df224cf46c","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"966025d8e18f282d438275aa512ebf848aed3d26621c7902588c517df8ad8398","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"67b60db2318a2489f0fb8027c5db5b5c1361122877db9e7e1c1d51b0f239a1f1","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"d72f13e829ad438c2b3c3493a0131278b97cb15f7423b555a7d13a60f16cf53c","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"dfda8d53bdad95372460588ae2c9233cd17a538c64bf993f004bb7803c2e6cf9","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"e353afcac28cb7a2b03e814554f274d4fd14e8e67ba9572b110c8028c2ae8f98","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"5e11470b3e931f34f63e34db56b68914a46e0a3e81962fb947c0cdfdd11d0c91","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"b9c82c399b5ece1033674ab730e74c174893871d4feea693d0bf66bbe0183321","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"6d4a65e92785f61e102599d8c81b756066080e408b0f143530862d387190ca03","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"71f7bfedc0d4613bae1d0972b8c9460fd32b32c87baf20fc8f2ea144c0b7eb3e","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"1dcd7319d0b5feb8e697c729611a62e298ca6d23f445306ace1fa8d99138d82e","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"87b2b072b2b1f3dad23f3afddd173a9c15f6c262282bc1ed0acd6d1693fe3bb6","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"367ee055e6c085c1ddb77c71b515f724d6b0d411e37527a661d848052b826b93","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"2ac34829ddd0e6d1d19578546a584b7fc26c4b07794254eb3f70e0cd9bfe518a","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"a0192324a52e0f07929803c2e63398ee78b50a90d40ba4b52689dde08cbd1db6","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"b817c35612dbce8e8129074d1a2c97b6a8d5d39b0a8205f5b5f42f8c20712e06","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"eef5d1bc984f416cfea8f0984faa758cdca39f4f148984f36f95816806be86e1","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"a1224a5216f2251f9139ee429763127cfbab97ae4db239eb3cfbfe0bd1d81be7","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"227b8a92b3608cf1113bd3f29925d8c4dc3f35fd3bf241689fc14b9ac71566ee","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"e78ea24747bd56882f132f40f7a9835507ca7d4f0fac906f636121feac774795","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"9ccc1cd3aa7ecad33e1fcea3d7135650f3e878ef0a9d3a4c7c6bae903ccc4357","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"ed86e4b5b91fb970a15411603ba3a4c49714ff76602f5d32d7a7838a2e4362d8","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"75f76c403760947bcda26217847051accbe51dc7677720c47ed5778f0b8f6191","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"bd4bbc7d06863b5a1683803e54d944dd58d90b758b0ae38fbff3a14ff99dcd96","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"0ecec889e02b82fdc97481a45def0bb07ff5f35ffd63389247fb3ee336ea27fb","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"df0104ad2ff9ca3693ded173871633cecb1a21952be6d0058f8741fdd5ca21d9","course_id":"COMPSCI/ISYE/MATH/STAT 726","course_uid":"course_639b02029dbf953b9704cd63","catalog_version_id":"3ffb1c2e239c93a18469051fc9647560bb2ded9d8fc21e4fe170808dea6fe6f8","course_number":726,"subjects":["COMPSCI","ISYE","MATH","STAT"],"title":"NONLINEAR OPTIMIZATION I","description":"Theory and algorithms for nonlinear optimization, focusing on unconstrained optimization. Line-search and trust-region methods; quasi-Newton methods; conjugate-gradient and limited-memory methods for large-scale problems; derivative-free optimization; algorithms for least-squares problems and nonlinear equations; gradient projection algorithms for bound-constrained problems; and simple penalty methods for nonlinearly constrained optimization. Students are strongly encouraged to have knowledge of linear algebra and familiarity with basic mathematical analysis.","requirements_text":"Graduate/professional standing"}]