ORIE 5320

ORIE 5320

Course information provided by the 2026-2027 Catalog.

From fitting regression models to training neural networks, many problems in artificial intelligence can be cast as optimization problems. This course studies the fundamentals of optimization as they apply to artificial intelligence. Much of the focus will be on convex optimization, covering topics such as convex analysis, gradient descent for constrained and unconstrained problems, proximal gradient descent, variants of Newton’s method, and the Frank-Wolfe algorithm. The treatment will be at a fairly sophisticated level, giving sound justifications for the algorithms studied.


Enrollment Priority Recommended prerequisites: MATH 1910 and MATH 2940; or equivalents.

Last 4 Terms Offered 2026FA, 2026SP

Learning Outcomes

  • Formulate and analyze unconstrained and constrained nonlinear optimization problems, identifying convexity, feasibility, and optimality conditions.
  • Apply and implement first- and second-order optimization algorithms, and evaluate their convergence behavior in practice.
  • Model and solve real-world applications using nonlinear optimization techniques in areas such as machine learning, engineering, and operations research.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Choose one lecture and one laboratory. Combined with: ORIE 3320

  • 3-4 Credits Stdnt Opt

  •  7786 ORIE 5320   LEC 001

    • MW
    • Sabach, S

  • Instruction Mode: In Person

    Enrollment limited to: graduate students.

  •  7787 ORIE 5320   LAB 401

    • R
    • Sabach, S

  • Instruction Mode: In Person

  •  7788 ORIE 5320   LAB 402

    • F
    • Sabach, S

  • Instruction Mode: In Person

Syllabi: none
  •   Regular Academic Session. 

  • 3-4 Credits Stdnt Opt

  •  7848 ORIE 5320   LEC 030

    • MW
    • Topaloglu, H

  • Instruction Mode: In Person

    Enrollment limited to: Cornell Tech students.