Networked Systems 254 - Nonlinear Optimization Methods

Institution:
University of California-Irvine
Subject:
Description:
Formulation, solution, and analysis of nonlinear programming problems. Unconstrained optimization, optimization over a convex set, Lagrange multiplier theory, Lagrange multiplier algorithms, duality theory, convex programming, dual methods, and multiobjective optimization theory. Emphasizes mathematical analysis. Prerequisite: Mathematics 2J or consent of instructor. Same as EECS261B.
Credits:
3.00
Credit Hours:
Prerequisites:
Corequisites:
Exclusions:
Level:
Instructional Type:
Lecture
Notes:
Additional Information:
Historical Version(s):
Institution Website:
Phone Number:
(949) 824-5011
Regional Accreditation:
Western Association of Schools and Colleges
Calendar System:
Quarter

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.

Detail Course Description Information on CollegeTransfer.Net

Copyright 2006 - 2025 AcademyOne, Inc.