MA305-6-AU-CO:
Nonlinear Programming

The details
2019/20
Mathematical Sciences
Colchester Campus
Autumn
Undergraduate: Level 6
Current
Thursday 03 October 2019
Saturday 14 December 2019
15
01 October 2019

 

Requisites for this module
MA205
(none)
(none)
(none)

 

(none)

Key module for

(none)

Module description

The course provides an introduction to the theory and applications of nonlinear programming. It teaches principles of good modelling, from formulation of practical problems to computer solution, and how to design a range of algorithms and numerical methods. It acquaints students with general issues concerning computational algorithms, and considers application areas such as mathematical finance.

The course has a significant practical component comprising four one-hour computer labs using the MATLAB computer package. These will include one on Newton-Raphson and golden section search,and one on Gradient search, Newton's method and Quasi-Newton methods.

Module aims

Syllabus

Nonlinear programming
- Formulation of unconstrained and constrained nonlinear optimisation models.
- One-dimensional search (Newton-Raphson, golden section search)
- Conditions for local optimality (quadratic forms, convex and concave functions, Taylor series for multiple variables).
- Gradient search, Newton's method, Quasi-Newton methods.
- Lagrange multiplier methods.
- Karush-Kuhn-Tucker optimality conditions.
- Penalty function methods.
- Non-derivative methods.

Module learning outcomes

On completing the module students should be able to:

- apply an appropriate algorithm or numerical method for solving a particular problem;
- discuss the relative advantages and limitations of the various algorithms and numerical methods;
- use given implementations of these algorithms in Matlab, and observe and analyse the results;
- understand the derivation and uses of the Karush-Kuhn-Tucker necessary conditions for optimality.

Module information

No additional information available.

Learning and teaching methods

This course runs at 3 hours per week. There are 20 lectures, 6 classes and 4 labs in total. In the Summer term 3 revision lectures are given.

Bibliography

This module does not appear to have any essential texts. To see non-essential items, please refer to the module's reading list.

Assessment items, weightings and deadlines

Coursework / exam Description Deadline Weighting
Coursework Lab Report 1 04/11/2019 50%
Coursework Lab Report 2 09/12/2019 50%
Exam 120 minutes during Summer (Main Period) (Main)

Overall assessment

Coursework Exam
20% 80%

Reassessment

Coursework Exam
0% 100%
Module supervisor and teaching staff
Dr Xinan Yang, email xyangk@essex.ac.uk
Dr Xinan Yang (xyank@essex.ac.uk)

 

Availability
Yes
Yes
No

External examiner

Prof Fionn Murtagh
Professor of Data Science
Resources
Available via Moodle
Of 33 hours, 28 (84.8%) hours available to students:
5 hours not recorded due to service coverage or fault;
0 hours not recorded due to opt-out by lecturer(s).

 

Further information
Mathematical Sciences

Disclaimer: The University makes every effort to ensure that this information on its Module Directory is accurate and up-to-date. Exceptionally it can be necessary to make changes, for example to programmes, modules, facilities or fees. Examples of such reasons might include a change of law or regulatory requirements, industrial action, lack of demand, departure of key personnel, change in government policy, or withdrawal/reduction of funding. Changes to modules may for example consist of variations to the content and method of delivery or assessment of modules and other services, to discontinue modules and other services and to merge or combine modules. The University will endeavour to keep such changes to a minimum, and will also keep students informed appropriately by updating our programme specifications and module directory.

The full Procedures, Rules and Regulations of the University governing how it operates are set out in the Charter, Statutes and Ordinances and in the University Regulations, Policy and Procedures.