Search Constraints
Number of results to display per page
Results for:
Algorithm Design and Optimization
Remove constraint Algorithm Design and Optimization
« Previous |
1 - 10 of 24
|
Next »
Search Results
-
Courseware
This course explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like game-playing engines, handwriting recognition, and machine translation. Through hands-on projects, students gain exposure to the theory behind graph search algorithms, classification, optimization, reinforcement learning, and other topics in artificial intelligence and machine learning as they incorporate them into their own Python programs. By course’s end, students emerge with experience in libraries for machine learning as well as knowledge of artificial intelligence principles that enable them to design intelligent systems of their own.
- Course related:
- COMP3011 Design and Analysis of Algorithms, COMP1001 Problem Solving Methodology in Information Technology, COMP4434 Artificial Intelligence, and COMP2011 Data Structures
- Subjects:
- Human-Computer Interaction and Computing
- Keywords:
- Computer programming Computer science Python (Computer program language) Artificial intelligence
- Resource Type:
- Courseware
-
MOOC
Operations management deals with operational planning and control issues, and is needed in all sectors of the society. One of the challenges to operations manager is how to make use of the available resources in the best way for meeting a certain objective. Quantitative approaches are inevitably needed in tackling many of such problems. Operations Research (OR) deals with problem formulation and application of analytical methods to assist in decision-making of operational problems in planning and control. The techniques of OR are useful quantitative tools to assist operations managers, and has a wide applicability in engineering, manufacturing, construction, financial and various service sectors. Operations Research is an applied mathematics subject and is also a course in many engineering and management programmes. This course is designed for both students learning OR and learners who are practitioners in their respective professionals. The mathematical procedures for the OR techniques are introduced in details in the examples provided in the course. This helps learners to master the methodology and the techniques and apply them to achieve their goals through active learning. This course introduces two prominent OR techniques and their extended topics. The Simplex Method for Linear Programming (LP) has been considered one of the top 10 algorithms of the 20th century. LP is an optimization technique for solving problems such as finding the optimal product mix, production plan, and shipment allocation, in order to maximize the profir or minimize the cost. The Critical Path Method (CPM) is a popular technique employed by project managers in scheduling project activities. Some extended topics of CPM are also introduced to deal with certain special situations in project management. In reality, many systems operate under stochastic environment and the operational problems cannot be solved by the known analytical methods. To this end, the simulation approach is introduced in the last chapter of this course. Simulation is a powerful technique for tackling OR problems under such situations.
- Subjects:
- Statistics and Research Methods
- Keywords:
- Operations research
- Resource Type:
- MOOC
-
Video
Convex Matrix Optimization (MOP) arises in a wide variety of applications. The last three decades have seen dramatic advances in the theory and practice of matrix optimization because of its extremely powerful modeling capability. In particular, semidefinite programming (SP) and its generalizations have been widely used to model problems in applications such as combinatorial and polynomial optimization, covariance matrix estimation, matrix completion and sensor network localization. The first part of the talk will describe the primal-dual interior-point methods (IPMs) implemented in SDPT3 for solving medium scale SP, followed by inexact IPMs (with linear systems solved by iterative solvers) for large scale SDP and discussions on their inherent limitations. The second part will present algorithmic advances for solving large scale SDP based on the proximal-point or augmented Lagrangian framework In particular, we describe the design and implementation of an augmented Lagrangian based method (called SDPNAL+) for solving SDP problems with large number of linear constraints. The last part of the talk will focus on recent advances on using a combination of local search methods and convex lifting to solve low-rank factorization models of SP problems.
Event date: 11/10/2022
Speaker: Prof. Kim-Chuan Toh (National University of Singapore)
Hosted by: Department of Applied Mathematics
- Subjects:
- Mathematics and Statistics
- Keywords:
- Convex programming Semidefinite programming
- Resource Type:
- Video
-
Video
We introduce a Dimension-Reduced Second-Order Method (DRSOM) for convex and nonconvex (unconstrained) optimization. Under a trust-region-like framework, our method preserves the convergence of the second-order method while using only Hessian-vector products in two directions. Moreover; the computational overhead remains comparable to the first-order such as the gradient descent method. We show that the method has a local super-linear convergence and a global convergence rate of 0(∈-3/2) to satisfy the first-order and second-order conditions under a commonly used approximated Hessian assumption. We further show that this assumption can be removed if we perform one step of the Krylov subspace method at the end of the algorithm, which makes DRSOM the first first-order-type algorithm to achieve this complexity bound. The applicability and performance of DRSOM are exhibited by various computational experiments in logistic regression, L2-Lp minimization, sensor network localization, neural network training, and policy optimization in reinforcement learning. For neural networks, our preliminary implementation seems to gain computational advantages in terms of training accuracy and iteration complexity over state-of-the-art first-order methods including SGD and ADAM. For policy optimization, our experiments show that DRSOM compares favorably with popular policy gradient methods in terms of the effectiveness and robustness.
Event date: 19/09/2022
Speaker: Prof. Yinyu Ye (Stanford University)
Hosted by: Department of Applied Mathematics
- Subjects:
- Mathematics and Statistics
- Keywords:
- Convex programming Nonconvex programming Mathematical optimization
- Resource Type:
- Video
-
Others
The SAP2000 name has been synonymous with state-of-the-art analytical methods since its introduction over 45 years ago. CSI solvers have been tried and tested by the industry for over 45 years. The SAPFire Analysis Engine can support multiple 64-bit solvers for analysis optimization and can perform both eigen analysis and Ritz analysis. Parallelization options are available to take advantage of multiple processors.
- Subjects:
- Structural Engineering
- Keywords:
- Structural analysis (Engineering) SAP2000 (Computer file) Structural engineering
- Resource Type:
- Others
-
MOOC
Operations Research (OR) is a field in which people use mathematical and engineering methods to study optimization problems in Business and Management, Economics, Computer Science, Civil Engineering, Industrial Engineering, etc. This course introduces frameworks and ideas about various types of optimization problems in the business world. In particular, we focus on how to formulate real business problems into mathematical models that can be solved by computers.
- Course related:
- LGT6801 Guided Study in Logistics I, LGT6202: Stochastic Models and Decision under Uncertainty, LGT6802 Guided Study in Logistics II, and LGT6803: Guided Study in Logistics III
- Keywords:
- Operations research
- Resource Type:
- MOOC
-
Courseware
In this card, we are going to help you understand the general concept of Binary Search.
Binary Search is one of the most fundamental and useful algorithms in Computer Science. It describes the process of searching for a specific value in an ordered collection.
Terminology used in Binary Search:
(1) Target - the value that you are searching for
(2) Index - the current location that you are searching
(3) Left, Right - the indicies from which we use to maintain our search Space
(4) Mid - the index that we use to apply a condition to determine if we should search left or right
- Course related:
- COMP3011 Design and Analysis of Algorithms
- Subjects:
- Computing
- Keywords:
- Computer algorithms
- Resource Type:
- Courseware
-
Video
In 40 episodes, Carrie Anne Philbin teaches you computer science! This course is based on introductory college-level material as well as the AP Computer Science Principles guidelines. By the end of this course, you will be able to: *Outline the history of computers and the design decisions that gave us modern computers *Describe the basic elements of programming and software *Identify the basic components of computer hardware and what they do *Describe how computers are used and how that has evolved over time *Appreciate how far computers have come and how far they might take us
- Course related:
- AMA2222 Principles of Programming
- Subjects:
- Computing
- Keywords:
- Computer science
- Resource Type:
- Video
-
Others
Nicholas John Higham FRS is a British numerical analyst. He is Royal Society Research Professor and Richardson Professor of Applied Mathematics in the School of Mathematics at the University of Manchester. In this blog, it covers the popular topic, such as: (1) Top 5 Beamer Tips (2) The Nearest Correlation Matrix (3) The Top 10 Algorithms in Applied Mathematics (4) A Black Background for More Restful PDF viewing (5) Typesetting Mathematics According to the ISO Standard (6) Fourth Edition (2013) of Golub and Van Loan’s Matrix Computations (7) The Rise of Mixed Precision Arithmetic (8) Second Edition (2013) of Matrix Analysis by Horn and Johnson (9) Half Precision Arithmetic: fp16 Versus bfloat16 (10) Managing BibTeX Files with Emacs (11) Five Examples of Proofreading (12) Implicit Expansion: A Powerful New Feature of MATLAB R2016b (13) Dot Grid Paper for Writing Mathematics (14) Programming Languages: An Applied Mathematics View (15) Three BibTeX Tips (16) Better LaTeX Tables with Booktabs (17) The Princeton Companion to Applied Mathematics (18) Numerical Methods That (Usually) Work (19) What’s New in MATLAB R2017a? (20) What Is Numerical Stability?
- Course related:
- AMA615 Nonlinear Optimization Methods and AMA611 Applied Analysis
- Subjects:
- Mathematics and Statistics
- Keywords:
- Computer programming Numerical analysis
- Resource Type:
- Others
-
e-book
As currently taught in the United States, introductory courses in analytical chemistry emphasize quantitative (and sometimes qualitative) methods of analysis along with a heavy dose of equilibrium chemistry. Analytical chemistry, however, is much more than a collection of analytical methods and an understanding of equilibrium chemistry; it is an approach to solving chemical problems. Although equilibrium chemistry and analytical methods are important, their coverage should not come at the expense of other equally important topics. The introductory course in analytical chemistry is the ideal place in the undergraduate chemistry curriculum for exploring topics such as experimental design, sampling, calibration strategies, standardization, optimization, statistics, and the validation of experimental results. Analytical methods come and go, but best practices for designing and validating analytical methods are universal. Because chemistry is an experimental science it is essential that all chemistry students understand the importance of making good measurements. My goal in preparing this textbook is to find a more appropriate balance between theory and practice, between “classical” and “modern” analytical methods, between analyzing samples and collecting samples and preparing them for analysis, and between analytical methods and data analysis. There is more material here than anyone can cover in one semester; it is my hope that the diversity of topics will meet the needs of different instructors, while, perhaps, suggesting some new topics to cover.
- Subjects:
- Chemistry
- Keywords:
- Chemistry Analytic -- Quantitative Textbooks
- Resource Type:
- e-book
- « Previous
- Next »
- 1
- 2
- 3