Math 320 Computation and Optimization 1 - Revision history

Ls5: Replaced content with "{{db-g7}}"

2013-04-03T22:17:11Z

Replaced content with "{{db-g7}}"

Ls5 at 21:58, 3 April 2013

2013-04-03T21:58:05Z

Ls5: Created page with "== Catalog Information == === Title === Computation and Optimization 1 === (Credit Hours:Lecture Hours:Lab Hours) === (3:3:0) === Offered === F === Prerequisite === [[Math 29..."

2013-04-01T21:56:49Z

Created page with "== Catalog Information == === Title === Computation and Optimization 1 === (Credit Hours:Lecture Hours:Lab Hours) === (3:3:0) === Offered === F === Prerequisite === [[Math 29..."

New page

== Catalog Information ==

=== Title ===
Computation and Optimization 1

=== (Credit Hours:Lecture Hours:Lab Hours) ===
(3:3:0)

=== Offered ===
F

=== Prerequisite ===
[[Math 290]], [[Math 313]], [[Math 314]]; concurrent with [[Math 334]], [[Math 344]], [[Math 321]]

=== Description ===
A treatment of algorithms used to solve these problems. Specific topics include Complexity and Data, Approximation Theory, Recursive Algorithms, Linear Optimization, Unconstrained Optimization, Constrained Optimization, Global Optimization.

== Desired Learning Outcomes ==

=== Prerequisites ===
[[Math 290]], [[Math 313]], [[Math 314]]; concurrent with [[Math 334]], [[Math 344]], [[Math 321]]

=== Minimal learning outcomes ===
Students will have a solid understanding of the concepts listed below. They will be able to prove many of the theorems that are central to this material. They will understand the model specifications for the optimization algorithms, and be able to recognize whether they apply to a given application or not. They will be able to perform the relevant computations on small, simple problems. They will be able to describe the optimization and approximation algorithms well enough that they could program simple versions of them, and will have a basic knowledge of the computational strengths and weaknesses of the algorithms covered.

# Complexity and Data
#* Asymptotic Analysis
#* Combinatorics
#* Graphs and Trees
#* Complexity (P, NP, NP Complete)
# Approximation Theory
#* Interpolation and Splines
#* Stone-Weierstrass Theorem
#* Bezier Curves
#* B-Splines
# Recursive Algorithms
#* Difference Calculus, including Summation by Parts
#* Simple linear recurrences
#* General linear recurrences
#* Generating functions
# Linear Optimization
#* Problem Formulation
#* Simplex Method
#* Duality
#* Applications
# Unconstrained Optimization
#* Steepest Descent
#* Newton
#* Broyden
#* Conjugate Gradient
#* Applications
# Constrained Optimization
#* Equality Constrained, Lagrange Multipliers
#* Inequality Constrained, KKT Condition
#* Applications
# Global Optimization
#* Interior Point Methods
#* Genetic Algorithms
#* Simulated Annealing

=== Textbooks ===
Possible textbooks for this course include (but are not limited to):

*

=== Additional topics ===

=== Courses for which this course is prerequisite ===

[[Category:Courses|320]]

← Older revision		Revision as of 22:17, 3 April 2013
Line 1:		Line 1:
	{{db-g7}}		{{db-g7}}
−	~~== Catalog Information ==~~
−
−	~~=== Title ===~~
−	~~Computation and Optimization 1~~
−
−	~~=== (Credit Hours:Lecture Hours:Lab Hours) ===~~
−	~~(3:3:0)~~
−
−	~~=== Offered ===~~
−	F
−
−	~~=== Prerequisite ===~~
−	~~[[Math 290]], [[Math 313]], [[Math 314]]; concurrent with [[Math 334]], [[Math 344]], [[Math 321]]~~
−
−
−	~~=== Description ===~~
−	A treatment of algorithms used to solve these problems. Specific topics include Complexity and Data, Approximation Theory, Recursive Algorithms, Linear Optimization, Unconstrained Optimization, Constrained Optimization, Global Optimization.
−
−	~~== Desired Learning Outcomes ==~~
−
−	~~=== Prerequisites ===~~
−	~~[[Math 290]], [[Math 313]], [[Math 314]]; concurrent with [[Math 334]], [[Math 344]], [[Math 321]]~~
−
−	~~=== Minimal learning outcomes ===~~
−	Students will have a solid understanding of the concepts listed below. They will be able to prove many of the theorems that are central to this material. They will understand the model specifications for the optimization algorithms, and be able to recognize whether they apply to a given application or not. They will be able to perform the relevant computations on small, simple problems. They will be able to describe the optimization and approximation algorithms well enough that they could program simple versions of them, and will have a basic knowledge of the computational strengths and weaknesses of the algorithms covered.
−
−	~~# Complexity and Data~~
−	~~#* Asymptotic Analysis~~
−	~~#* Combinatorics~~
−	~~#* Graphs and Trees~~
−	~~#* Complexity (P, NP, NP Complete)~~
−	~~# Approximation Theory~~
−	~~#* Interpolation and Splines~~
−	~~#* Stone-Weierstrass Theorem~~
−	~~#* Bezier Curves~~
−	~~#* B-Splines~~
−	~~# Recursive Algorithms~~
−	~~#* Difference Calculus, including Summation by Parts~~
−	~~#* Simple linear recurrences~~
−	~~#* General linear recurrences~~
−	~~#* Generating functions~~
−	~~# Linear Optimization~~
−	~~#* Problem Formulation~~
−	~~#* Simplex Method~~
−	~~#* Duality~~
−	~~#* Applications~~
−	~~# Unconstrained Optimization~~
−	~~#* Steepest Descent~~
−	~~#* Newton~~
−	~~#* Broyden~~
−	~~#* Conjugate Gradient~~
−	~~#* Applications~~
−	~~# Constrained Optimization~~
−	~~#* Equality Constrained, Lagrange Multipliers~~
−	~~#* Inequality Constrained, KKT Condition~~
−	~~#* Applications~~
−	~~# Global Optimization~~
−	~~#* Interior Point Methods~~
−	~~#* Genetic Algorithms~~
−	~~#* Simulated Annealing~~
−
−
−	~~=== Textbooks ===~~
−	~~Possible textbooks for this course include (but are not limited to):~~
−
−	*
−
−	~~=== Additional topics ===~~
−
−	~~=== Courses for which this course is prerequisite ===~~
−
−	~~[[Category:Courses\|320]]~~

← Older revision		Revision as of 21:58, 3 April 2013
Line 1:		Line 1:
		+	{{db-g7}}
	== Catalog Information ==		== Catalog Information ==