C S 412 - Linear Programming and Convex Optimization

Institution:

Brigham Young University-Provo

Subject:

Computer Science

Description:

Optimization, problem formulation, and solution algorithms, including simplex and interior point methods. Applications from control, data mining, finance, game theory, learning, network flow, operations research, and statistical estimation.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.byu.edu

Phone Number:

(801) 422-4636

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Semester

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.