APP MTH 4114 - Optimisation - Honours
North Terrace Campus - Semester 1 - 2018
General Course Information
Course Code APP MTH 4114 Course Optimisation - Honours Coordinating Unit School of Mathematical Sciences Term Semester 1 Level Undergraduate Location/s North Terrace Campus Units 3 Contact Up to 3 hours per week Available for Study Abroad and Exchange Prerequisites MATHS 1012 Assumed Knowledge Knowledge of linear programming such as would be obtained from APP MTH 2105 and basic computer programming skills such as would be obtained from COMP SCI 1012, 1101, MECH ENG 1100, 1102, 1103, 1104, 1105, C&ENVENG 1012 Course Description Most problems in life are optimisation problems: what is the best design for a racing kayak? How do you get the best return on your investments? What is the best use of your time in swot vac? What is the shortest route across town for an emergency vehicle? What are the optimal release rates from a dam for environmental flows in a river? Mathematical formulations of such optimisation problems might contain one or many independent variables. There may or may not be constraints on those variables. However, there is always an objective: minimise or maximise some function of the variable(s) subject to the constraints. This course examines nonlinear mathematical formulations, and concentrates on convex optimisation problems. Many modern optimisation methods in areas such as design of communication networks and finance rely on the classical underpinnings covered in this course. Topics covered are: One-dimensional (line) searches, direct methods, polynomial approximation, methods for differentiable functions; Theory of convex and nonconvex functions relevant to optimisation; Multivariable unconstrained optimisation, quasi-Newton Method, steepest descent methods, conjugate gradient methods; Constrained optimisation, including Karush-Kuhn-Tucker conditions and the Gradient Projection Method; Heuristics for non-convex problems, genetic algorithms.
Course Coordinator: Professor Anthony Roberts
The full timetable of all activities for this course can be accessed from Course Planner.
Course Learning Outcomes1. Understand the complexities of, and techniques for solving, nonlinear optimisation problems.
2. Apply suitable algorithms to one- or multi-dimensional optimisation problems.
3. Understand the theoretical framework underlying the techniques presented in class.
4. Implement computer code for the algorithms as studied in class and critically analyse and interpret the results.
5. Demonstrate skills in communicating mathematics orally and in writing.
6. Demonstrate the ability to work in a group applying the theory developed in this course.
University Graduate Attributes
This course will provide students with an opportunity to develop the Graduate Attribute(s) specified below:
University Graduate Attribute Course Learning Outcome(s) Deep discipline knowledge
- informed and infused by cutting edge research, scaffolded throughout their program of studies
- acquired from personal interaction with research active educators, from year 1
- accredited or validated against national or international standards (for relevant programs)
1,2,3,4 Critical thinking and problem solving
- steeped in research methods and rigor
- based on empirical evidence and the scientific approach to knowledge development
- demonstrated through appropriate and relevant assessment
1,3,4,5,6 Teamwork and communication skills
- developed from, with, and via the SGDE
- honed through assessment and practice throughout the program of studies
- encouraged and valued in all aspects of learning
5,6 Career and leadership readiness
- technology savvy
- professional and, where relevant, fully accredited
- forward thinking and well informed
- tested and validated by work based experiences
1,5,6 Intercultural and ethical competency
- adept at operating in other cultures
- comfortable with different nationalities and social contexts
- able to determine and contribute to desirable social outcomes
- demonstrated by study abroad or with an understanding of indigenous knowledges
5,6 Self-awareness and emotional intelligence
- a capacity for self-reflection and a willingness to engage in self-appraisal
- open to objective and constructive feedback from supervisors and peers
- able to negotiate difficult social situations, defuse conflict and engage positively in purposeful debate
Required ResourcesAccess to the intranet.
Recommended ResourcesEdwin K.P. Chong and Stanislaw H. Zak. An Introduction to Optimization. 3rd edition. John Wiley & Sons, 2008. doi: 10.1002/9781118033340
Online LearningAll assignments, tutorials, handouts and solutions, where appropriate, will be made available on MyUni as the course progresses.Recordings of lectures will generally be available on MyUni following each lecture.
Learning & Teaching Activities
Learning & Teaching ModesThe lecturer guides the students through the course material in 36 classes. Students are to engage with the material in the classes and in private study. Interaction with the lecturer and discussion of any difficulties that arise during the lecture is encouraged. Students are expected to participate in all lectures. Frequent small homework assignments will promote staged active learning. Fortnightly assignments help students strengthen their understanding of the theory and their skills in applying it, and allow them to gauge their progress. Small open-ended projects aim to facilitate developing investigative and integrative analytical skills.
The information below is provided as a guide to assist students in engaging appropriately with the course requirements.
Activity Quantity Workload Hours Lectures 36 90 Homework TBA 18 Assignments 6 48 Total 156
Learning Activities Summary
- Single variable optimisation: Introduction, Dichotomous and Golden section searches, unbounded searches, Quadratic approximation, Newton's and secant methods
- Unconstrained multi-variable optimisation: introduction to unconstrained problems, Levenberg--Marquardt method, convexity, theorems for minimality and descent methods, Steepest descent on quadratics, Conjugate gradient method, Fletcher-Reeves algorithm
- Constrained convex optimisation: introduction to constrained optimisation, Linear constraints, Lagrange multipliers, KKT conditions, Generalisations of KKT conditions, orthogonal projection, Gradient Projection algorithm
- Non-convex optimisation: introduction to non-convex optimisation; methods from Genetic Algorithms, Simulated Annealing, Monte Carlo optimisation
The University's policy on Assessment for Coursework Programs is based on the following four principles:
- Assessment must encourage and reinforce learning.
- Assessment must enable robust and fair judgements about student performance.
- Assessment practices must be fair and equitable to students and give them the opportunity to demonstrate what they have learned.
- Assessment must maintain academic standards.
Assessment task Task type Weighting Learning outcomes Examination Summative 70% All Assignments Formative and summative 30% All
Assessment Related RequirementsAn aggregate score of at least 50% is required to pass the course.
Assessment item Distributed Due date Weighting Assignment 1 Week 2 Week 3 4% Assignment 2 Week 4 Week 5 4% Assignment 3 Week 6 Week 7 4% Assignment 4 Week 8 Week 9 4% Assignment 5 Week 10 Week 11 4% Assignment 6 Week 12 Week 13 4% Homework / Project ongoing ongoing 6%
- All written assignments are to be either submitted to the designated hand in boxes within the School of Mathematical Sciences with a signed cover sheet attached, or submitted as pdf via MyUni.
- Late assignments will require a request prior to the due date, and a medical certificate or other documentation.
- Assignments normally have a one week turn-around time for feedback to students.
Grades for your performance in this course will be awarded in accordance with the following scheme:
M11 (Honours Mark Scheme) Grade Grade reflects following criteria for allocation of grade Reported on Official Transcript Fail A mark between 1-49 F Third Class A mark between 50-59 3 Second Class Div B A mark between 60-69 2B Second Class Div A A mark between 70-79 2A First Class A mark between 80-100 1 Result Pending An interim result RP Continuing Continuing CN
Further details of the grades/results can be obtained from Examinations.
Grade Descriptors are available which provide a general guide to the standard of work that is expected at each grade level. More information at Assessment for Coursework Programs.
Final results for this course will be made available through Access Adelaide.
The University places a high priority on approaches to learning and teaching that enhance the student experience. Feedback is sought from students in a variety of ways including on-going engagement with staff, the use of online discussion boards and the use of Student Experience of Learning and Teaching (SELT) surveys as well as GOS surveys and Program reviews.
SELTs are an important source of information to inform individual teaching practice, decisions about teaching duties, and course and program curriculum design. They enable the University to assess how effectively its learning environments and teaching practices facilitate student engagement and learning outcomes. Under the current SELT Policy (http://www.adelaide.edu.au/policies/101/) course SELTs are mandated and must be conducted at the conclusion of each term/semester/trimester for every course offering. Feedback on issues raised through course SELT surveys is made available to enrolled students through various resources (e.g. MyUni). In addition aggregated course SELT data is available.
- Academic Support with Maths
- Academic Support with writing and speaking skills
- Student Life Counselling Support - Personal counselling for issues affecting study
- International Student Support
- AUU Student Care - Advocacy, confidential counselling, welfare support and advice
- Students with a Disability - Alternative academic arrangements
- Reasonable Adjustments to Teaching & Assessment for Students with a Disability Policy
- LinkedIn Learning
Policies & Guidelines
This section contains links to relevant assessment-related policies and guidelines - all university policies.
- Academic Credit Arrangement Policy
- Academic Honesty Policy
- Academic Progress by Coursework Students Policy
- Assessment for Coursework Programs
- Copyright Compliance Policy
- Coursework Academic Programs Policy
- Elder Conservatorium of Music Noise Management Plan
- Intellectual Property Policy
- IT Acceptable Use and Security Policy
- Modified Arrangements for Coursework Assessment
- Student Experience of Learning and Teaching Policy
- Student Grievance Resolution Process
Students are reminded that in order to maintain the academic integrity of all programs and courses, the university has a zero-tolerance approach to students offering money or significant value goods or services to any staff member who is involved in their teaching or assessment. Students offering lecturers or tutors or professional staff anything more than a small token of appreciation is totally unacceptable, in any circumstances. Staff members are obliged to report all such incidents to their supervisor/manager, who will refer them for action under the university's student’s disciplinary procedures.
The University of Adelaide is committed to regular reviews of the courses and programs it offers to students. The University of Adelaide therefore reserves the right to discontinue or vary programs and courses without notice. Please read the important information contained in the disclaimer.