Wiki Τμήματος Μαθηματικών
Non Linear Programming (ΣΕΕ7)

Non Linear Programming (ΣΕΕ7)

Από Wiki Τμήματος Μαθηματικών
Αναθεώρηση ως προς 13:59, 13 Ιουνίου 2022 από τον Mathwikiadmin (συζήτηση | συνεισφορές) (Νέα σελίδα με '=== General === {| class="wikitable" |- ! School | School of Science |- ! Academic Unit | Department of Mathematics |- ! Level of Studies | Graduate |- ! Course Code | ΣΣΕ7 |- ! Semester | 2 |- ! Course Title | Non Linear Programing |- ! Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 7.5) |- ! Course Type | Special Background |- ! Prerequisite Courses | - |- ! Language of Instruction and Examinations | Greek |- ! Is the Course O...')
(διαφορά) ← Παλαιότερη αναθεώρηση | Τελευταία αναθεώρηση (διαφορά) | Νεότερη αναθεώρηση → (διαφορά)

General

School School of Science
Academic Unit Department of Mathematics
Level of Studies Graduate
Course Code ΣΣΕ7
Semester 2
Course Title Non Linear Programing
Independent Teaching Activities Lectures (Weekly Teaching Hours: 3, Credits: 7.5)
Course Type Special Background
Prerequisite Courses -
Language of Instruction and Examinations Greek
Is the Course Offered to Erasmus Students Yes (in English)
Course Website (URL) -

Learning Outcomes

Learning outcomes The course aims to introduce students to the fundamentals of non-linear optimization. Upon successful completion of the course the student will be able to:
  1. understand the basic principles of nonlinear optimization problems.
  2. use some of the commonly used algorithms for nonlinear optimization (unconstrained and constrained).
  3. select the appropriate algorithm for a particular optimization problem.
General Competences
  1. Working independently
  2. Decision-making
  3. Adapting to new situations
  4. Production of free, creative and inductive thinking
  5. Synthesis of data and information, with the use of the necessary technology

Syllabus

Introduction to unconstrained and constrained optimization, Lagrange Multipliers, Karush-Kuhn-Tucker conditions, Line Search, Trust Region, Conjugate Gradient, Newton, Quasi-Newton methods, Quadratic Programming, Penalty Barrier and Augmented Lagrangian Methods.

Teaching and Learning Methods - Evaluation

Delivery Face-to-face
Use of Information and Communications Technology Lindo/Lingo Software, Mathematica, Email, class web
Teaching Methods
Activity Semester Workload
Lectures 39
Study and analysis of bibliography 78
Preparation of assignments and interactive teaching 70.5
Course total 187.5
Student Performance Evaluation LANGUAGE OF EVALUATION: Greek
METHODS OF EVALUATION: Written work (30%), Final exam (70%).

Attached Bibliography

Suggested bibliography:

  1. Bazarra, Sherali, and Shetty Nonlinear Programming: Theory and Algorithms, 3rd Edition, John Wiley & Sons, 2006
  2. Bertsekas D. Nonlinear Programming, Athena Scientic, 2004
  3. Luenberger, David G.; Ye, Yinyu (2008). Linear and nonlinear programming. (Fourth ed). New York: Springer
  4. Γεωργίου Α. Βασιλείου Π.-Χ. Μη γραμμικές μέθοδοι βελτιστοποίησης, Εκδόσεις Ζήτη, 1996
  5. Παπαγεωργίου Μ. Μη γραμμικός προγραμματισμός. Ηλεκτρονικό σύγγραμμα.

Related academic journals:

  1. Computational Optimization and Applications
  2. Journal of Global Optimization
  3. Journal of Optimization Theory and Applications
  4. Optimal Control Applications and Methods
  5. Optimization
  6. SIAM Journal on Optimization (SIOPT).
Ανακτήθηκε από «https://wiki.math.uoi.gr/index.php?title=Non_Linear_Programming_(ΣΕΕ7)&oldid=12»