Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
An Introduction to Optimization for STEM Students
Rating: 4.3 out of 5(14 ratings)
188 students

An Introduction to Optimization for STEM Students

Optimization methods programmed in Fortran90 and Python. Downloadable notes and codes.
Created byRobert Spall
Last updated 1/2024
English

What you'll learn

  • Basic Techniques in Engineering Optimization
  • Newtons and Secant methods for one dimensional unconstrained problems.
  • Golden search bracketed method for one-dimensional unconstrained problems.
  • Univariate search for multi-dimensional unconstrained problems.
  • Steepest Ascent Method for multi-dimensional unconstrained problems.
  • Newton’s Method for a multi-dimensional unconstrained problem.
  • Lagrange multiplier method for multi-dimensional equality constraint problems.
  • Lagrange multiplier method for multi-dimensional inequality constraint problems.

Course content

4 sections25 lectures1h 29m total length
  • Introductory Material3:29
  • Newton's Method for Root Finding1:54
  • Newton's Method for Optimization1:59
  • Secant Method for Optimization2:25
  • Example 1D Optimization Problem2:54
  • Golden Search Method6:17
  • Example Using Golden Search Method3:36
  • Root Finding Homework Problem
  • 1D Optimization Homework using Newton's Method
  • 1D Optimization Homework using the Secant method
  • Optimization Homework Using the Golden Search Method

Requirements

  • Basic calculus and linear algebra, computer programming skills.

Description

This course provides a basic introduction to optimization methods for science and engineering students which is often taught as part of an undergraduate-level numerical methods class. The material covered here is at that level, and includes:

· Newton and Secant methods for one dimensional unconstrained problems.

· Golden search bracketed method for one-dimensional unconstrained problems.

· Univariate search for multi-dimensional unconstrained problems.

· Steepest Ascent Method for multi-dimensional unconstrained problems.

· Newton’s Method for a multi-dimensional unconstrained problem.

· Lagrange multiplier method for multi-dimensional equality constraint problems.

· Lagrange multiplier method for multi-dimensional inequality constraint problems.

· Example problems using the above methods.

Course notes are available for download. Computer codes used to solve these problems, written in both Fortran95 and Python, are also available for download and may be easily modified for your own use.

The material presented is suitable for students in a sophomore or junior level science, technology, engineering and/or mathematics numerical methods class. A background in calculus is necessary, as is the ability to program in a computer language such as Fortran90, C, C++, Python, MatLab, etc.

x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x

Who this course is for:

  • Engineering students at the sophomore/junior level and others interested in learning basic optimization techniques who have the necessary background.