MATH 478
Non‑Linear Programming
Fall 2023
Topics
- Multivariable calculus review
- Convex sets and convex functions
- Convex optimization and duality
- Selected topics in convex analysis
Readings
- Listed textbook (requirement not stated): Boyd and Vandenberghe. Convex Optimization. http://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf
- Accompanying lecture slides: http://www.stanford.edu/~boyd/cvxbook/bv_cvxslides.pdf
- Accompanying errata: https://web.stanford.edu/~boyd/cvxbook/cvxbook_errata.html
Fall 2021 · MATH 478
Readings
- Convex Optimization by Boyd and Vandenberghe.
Sources
- Course catalogue ↗2026–2027
- Syllabus or course outline ↗Fall 2023
- Historical course outline ↗Fall 2021
- Fall 2023 outline. Course header explicitly lists MATH 478, MAST 661. Additional materials are to be posted on Moodle but are not named in the public outline.
- Historical source. Generic Textbook/References headings remain requirement-unspecified. Bibliographic editions and years are retained as printed; source inconsistencies may remain. Automated extraction with conservative filtering; distinct bibliography strings screened for false positives; entire syllabus not manually reviewed.