Introduction To Optimization

ISYE-6780

Convex sets and functions, optimality conditions in nonlinear programming, Lagrangian duality, quadratic programming algorithms for nonlinear programming including Newton’s method, quasi-Newton methods, conjugate gradient methods, together with proofs of convergence.

4 credits
Prereqs:
none

Past Term Data

Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Spring Summer Fall
(Session 1) (Session 2)
2024
Introduction To Optimization (4c)
  • John E. Mitchell
Seats Taken: 0/15
2023
Introduction To Optimization (4c)
  • Yangyang Xu
Seats Taken: 4/15
2022
Introduction To Optimization (4c)
  • Rongjie Lai
Seats Taken: 0/15
2021
Introduction To Optimization (4c)
  • Rongjie Lai
Seats Taken: 0/10
2020
Introduction To Optimization (4c)
  • John E. Mitchell
Seats Taken: 0/30
Introduction To Optimization (4c)
  • Rongjie Lai
Seats Taken: 1/10
2019
2018
Introduction To Optimization (4c)
  • John E. Mitchell
  • Yangyang Xu
Seats Taken: 3/30
2017
Nonlinear Programming (4c)
  • Yangyang Xu
Seats Taken: 5/30
2016
Nonlinear Programming (4c)
  • John E. Mitchell
Seats Taken: 3/20
2015
Nonlinear Programming (4c)
  • John E. Mitchell
Seats Taken: 3/20
2014
Nonlinear Programming (4c)
  • John E. Mitchell
Seats Taken: 9/20
2013
Nonlinear Programming (4c)
  • John E. Mitchell
Seats Taken: 1/30
2012
Nonlinear Programming (4c)
  • John E. Mitchell
Seats Taken: 6/30
2011
Nonlinear Programming (4c)
  • John E. Mitchell
Seats Taken: 1/30
2010
Nonlinear Programming (4c)
  • Kristin P Bennett
Seats Taken: 7/30
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998