MA 4235Nonlinear Optimization

Worcester Polytechnic Institute · 3 credits · UGRD

Catalog

Cat II. This course explores theoretical conditions for the existence of solutions and effective computational procedures to find these solutions for optimization problems involving nonlinear functions. Topics covered include: fundamentals of optimization, convex optimization, classical optimization techniques, line search methods, including Newton’s method and the method of steepest descent, Lagrange multipliers and Karush-Kuhn-Tucker theory, algorithms for constrained and unconstrained problems, and applications. Further topics may include: duality in nonlinear programming, penalty functions, conjugate gradient methods, stochastic gradient descent, or trust region methods. Recommended Background Multivariable calculus at the level of MA 1024: Calculus IV and linear algebra at the level of MA 2071: Matrices & Linear Algebra 1.

Recent sections

Spring 2027 · 1 section

Jan 13 – Mar 5

SectionDays & timeLocationInstructor
C01Class #MA 4235-C01Tu Fr · 2:00 – 3:50 PMStratton Hall 301Gu Wang
C01 notes: Native period: 2027 Spring C Term; Native section label: MA 4235-C01 - Nonlinear Optimization; Native format: Lecture; Native section details: Stratton Hall 301 | T-F | 2:00 PM - 3:50 PM