School/Faculty/Institute | Faculty of Engineering | ||||
Course Code | IE 437 | ||||
Course Title in English | Numerical Methods and Optimization | ||||
Course Title in Turkish | Sayısal Yöntemler ve Optimizasyon | ||||
Language of Instruction | EN | ||||
Type of Course | Flipped Classroom | ||||
Level of Course | Intermediate | ||||
Semester | Fall | ||||
Contact Hours per Week |
|
||||
Estimated Student Workload | 150 hours per semester | ||||
Number of Credits | 6 ECTS | ||||
Grading Mode | Standard Letter Grade | ||||
Pre-requisites |
COMP 109 - Computer Programming (JAVA) MATH 211 - Linear Algebra |
||||
Expected Prior Knowledge | Prior knowledge in linear algebra and computer programming | ||||
Co-requisites | None | ||||
Registration Restrictions | - | ||||
Overall Educational Objective | To learn and apply theoretical and algorithmic concepts related to systems of equations and continuous optimization | ||||
Course Description | This course presents theoretical and algorithmic aspects related to systems of equations and continuous optimization problems. The ideas behind the numerical methods developed to solve such systems and problems, their connection to the theoretical results and optimality conditions, as well as their convergence behavior are covered. The following topics will be included in the course: solving systems of linear equations by direct and iterative methods; solution of nonlinear equations by iterative methods; approximating functions; fundamental concepts of optimization; theory of unconstrained optimization; line search methods for unconstrained optimization; theory of constrained optimization; effect of equality constraints; effect of inequality constraints; general formulation of nonlinear programming, solving the KKT system. | ||||
Course Description in Turkish | Bu ders, denklem sistemlerinin ve sürekli optimizasyon problemlerinin teorik ve algoritmik boyutlarını tanıtır. Bu sistemleri ve problemleri çözmek için geliştirilmiş sayısal yöntemlerin ardındaki ana fikir, bunların optimizasyon teorisine ve optimal olma şartlarına bağlantısı ve dahi yakınsama oranları işlenir. Dersin içeriğinde şu konular yer alır: doğrudan ve iteratif yöntemlerle doğrusal denklem sistemlerinin çözümü; doğrusal olmayan denklem sistemlerinin iteratif yöntemlerle çözümü; yaklaşık fonksiyonlar; optimizasyonun temel kavramları; kısıtsız optimizasyon teorisi; kısıtsız optimizasyon için hat arama metotları ve güven bölgesi metotları; kısıtlı optimizasyon teorisi; eşitlik kısıtlarının etkisi; eşitsizlik kısıtlarının etkisi; doğrusal olmayan programların genel formülasyonu; KKT sistemlerinin çözümü. |
Course Learning Outcomes and CompetencesUpon successful completion of the course, the learner is expected to be able to:1) understand systems of linear equations and apply solution methods for them; 2) understand systems of nonlinear equations and apply solution methods for them; 3) apply theoretical results on optimality conditions and solution methods for unconstrained optimization; 4) understand and apply theoretical results on optimality conditions for constrained optimization; 5) implement algorithms for systems of equations and unconstrained optimization. |
Program Learning Outcomes/Course Learning Outcomes | 1 | 2 | 3 | 4 | 5 |
---|---|---|---|---|---|
1) Thorough knowledge of the major concepts, theoretical perspectives, empirical findings, and historical trends in psychology. | |||||
2) Understanding of and ability to apply essential research methods in psychology, including research design, data analysis, and data interpretation. | |||||
3) Competence to use critical and creative thinking, skeptical inquiry and a scientific approach to solving problems related to behavior and mental processes. | |||||
4) Understanding and ability to apply psychological principles, skills and values in personal, social, and organizational contexts. | |||||
5) Ability to weigh evidence, to tolerate ambiguity, and to reflect other values that underpin psychology as a discipline. | |||||
6) Internalization and dissemination of professional ethical standards. | |||||
7) Demonstration of competence in information technologies, and the ability to use computer and other technologies for purposes related to the pursuit of knowledge in psychology and the broader social sciences. | |||||
8) Skills to communicate the knowledge of psychological science effectively, in a variety of formats, in both Turkish and in English (in English, at least CEFR B2 level). | |||||
9) Recognition, understanding, and respect for the complexity of sociocultural and international diversity. | |||||
10) Recognition for the need for, and the skills to pursue, lifelong learning, inquiry, and self-improvement. | |||||
11) Ability to formulate critical hypotheses based on psychological theory and literature, and design studies to test those hypotheses. | |||||
12) Ability to acquire knowledge independently, and to plan one’s own learning. | |||||
13) Demonstration of advanced competence in the clarity and composition of written work and presentations. |
N None | S Supportive | H Highly Related |
Program Outcomes and Competences | Level | Assessed by | |
1) | Thorough knowledge of the major concepts, theoretical perspectives, empirical findings, and historical trends in psychology. | N | |
2) | Understanding of and ability to apply essential research methods in psychology, including research design, data analysis, and data interpretation. | N | |
3) | Competence to use critical and creative thinking, skeptical inquiry and a scientific approach to solving problems related to behavior and mental processes. | H | Exam,HW,Participation |
4) | Understanding and ability to apply psychological principles, skills and values in personal, social, and organizational contexts. | N | |
5) | Ability to weigh evidence, to tolerate ambiguity, and to reflect other values that underpin psychology as a discipline. | N | |
6) | Internalization and dissemination of professional ethical standards. | N | |
7) | Demonstration of competence in information technologies, and the ability to use computer and other technologies for purposes related to the pursuit of knowledge in psychology and the broader social sciences. | N | |
8) | Skills to communicate the knowledge of psychological science effectively, in a variety of formats, in both Turkish and in English (in English, at least CEFR B2 level). | N | |
9) | Recognition, understanding, and respect for the complexity of sociocultural and international diversity. | S | Participation |
10) | Recognition for the need for, and the skills to pursue, lifelong learning, inquiry, and self-improvement. | S | HW,Participation |
11) | Ability to formulate critical hypotheses based on psychological theory and literature, and design studies to test those hypotheses. | N | |
12) | Ability to acquire knowledge independently, and to plan one’s own learning. | S | Exam,HW |
13) | Demonstration of advanced competence in the clarity and composition of written work and presentations. | H | Exam,HW |
Prepared by and Date | FİLİZ GÜRTUNA , December 2023 |
Course Coordinator | FİLİZ GÜRTUNA |
Semester | Fall |
Name of Instructor | Asst. Prof. Dr. FİLİZ GÜRTUNA |
Week | Subject |
1) | Systems of Equations and Types of Optimization Problems |
2) | Solving Systems of Linear Equations: LU and Cholesky Factorizations |
3) | Solution of Linear Equations: Iterative Methods |
4) | Solution of Nonlinear Equations: Bisection and Newton’s Methods |
5) | Solution of Nonlinear Equations: Secant Method |
6) | Solution of Nonlinear Equations: Fixed Points |
7) | Solution of Nonlinear Equations: Roots of Polynomials |
8) | Approximating Functions: Polynomial Interpolation |
9) | Approximating Functions: Least Squares Problems |
10) | Theory of Unconstrained Optimization |
11) | Unconstrained Optimization: Line Search Methods (Steepest Descent) |
12) | Unconstrained Optimization: Line Search Methods (Newton’s Method, Quasi-Newton Methods) |
13) | Theory of Constrained Optimization: Equality and Inequality Constraints |
14) | Theory of Constrained Optimization: Solving Optimality Conditions |
15) | Final Exam/Project/Presentation period |
16) | Final Exam/Project/Presentation period |
Required/Recommended Readings | • Lecture Notes • Kincaid, D., Cheney, W., (2002). Numerical Analysis (3rd Edition). American Mathematical Society | ||||||||||||||||||
Teaching Methods | Lectures/contact hours using “flipped classroom” as an active learning technique | ||||||||||||||||||
Homework and Projects | Homework involves computer programming | ||||||||||||||||||
Laboratory Work | - | ||||||||||||||||||
Computer Use | Yes | ||||||||||||||||||
Other Activities | - | ||||||||||||||||||
Assessment Methods |
|
||||||||||||||||||
Course Administration |
gurtunaf@mef.edu.tr - Exams and quizzes: Closed book and closed notes. Rules for attendance: YÖK regulations. You are responsible for the announcements made in class. Rules for late submission of assignments: Homework deadlines are always extendable up to 72 hours, with submissions late for (0,24] hours receive 70% of the credit they get, (24,48] hours receive 35% , and (48,72] receive 10%. Missing a quiz: NA Missing a project: NA Missing a midterm: You are expected to be present without exception and to plan any travel around these dates accordingly. Medical emergencies are of course excluded if accompanied by a doctor’s note. A note indicating that you were seen at the health center on the day of the exam is not a sufficient documentation of medically excused absence from the exam. The note must say that you were medically unable to take the exam. Provided that proper documents of excuse are presented, a make-up exam will be given for each missed midterm. If you fail to take the exam on the assigned day and do not have a valid excuse, you will be given zero (0) on the exam. Employment interviews, employer events, weddings, vacations, etc. are not excused absences. Eligibility to take the final exam: YÖK regulations. Missing a final: Faculty regulations. Improper behavior, academic dishonesty and plagiarism : YÖK Disciplinary Regulation |
Activity | No/Weeks | Hours | Calculation | ||||
No/Weeks per Semester | Preparing for the Activity | Spent in the Activity Itself | Completing the Activity Requirements | ||||
Course Hours | 14 | 1 | 3 | 56 | |||
Homework Assignments | 3 | 10 | 10 | 60 | |||
Midterm(s) | 1 | 15 | 2 | 17 | |||
Final Examination | 1 | 15 | 2 | 17 | |||
Total Workload | 150 | ||||||
Total Workload/25 | 6.0 | ||||||
ECTS | 6 |