COPT: A C++ Open Optimization Library

Size: px
Start display at page:

Download "COPT: A C++ Open Optimization Library"

Transcription

1 COPT: A C++ Open Optimization Library {Zhouwang Yang, Ruimin Wang}@MathU School of Mathematical Science University of Science and Technology of China

2 Zhouwang Yang Ruimin Wang University of Science and Technology of China (USTC)

3 Mathematical Optimization The selection of a best element from some set of available alternatives Long history Fermat & Lagrange: calculus based formulas Newton & Gauss: iterative method

4 Mathematical Optimization Various subfields Convex programming Integer programming Fractional programming Nonlinear programming Stochastic programming Robust programming Dynamic programming Combinatorial optimization Infinite dimensional optimization

5 Mathematical Optimization Very useful in many fields Industry Bioinformatics Financial engineering Machine learning/data mining A lot of models and algorithms

6 Mathematical Optimization A lot of similarities among different problems Minimize or maximize certain energy function Specific constraint is asked to be satisfied Aframeworkcanbedesigned

7 Motivation Huge amount of algorithms A lot of repeated work (very low reusability) Existing tools Matlab optimization toolbox (commercial) Scipy (free) Various open libraries (C/C++, Python, )

8 Motivation Hard to follow and extend Matlab actually uses C as underlying code So does Python Framework differs a lot from each other in open libraries

9 Motivation To build a domestic library for optimization study A fast implementation For researchers/ followers A good opportunity to train coding skills For students

10 Target Create an optimization library (Domestic, Created in China) Integrate existing resources Flexible enough for different problems

11 Target Open source Cross platform IDE independent skills gcc, g++, gfotran MakeFile or CMakeList.txt Carefully designed interface

12 Benefit Provide an easy to code framework for doing optimization related study Enhance the communication with industry Improve coding skills of the students in the Society of Mathematical Programming

13 Why C++ Performance per $ Power: driver at all scales Size: limits on processor resources Experience: bigger experience on smaller hardware

14 Why C++

15 Why C++

16 Why C++ Efficiency Flexibility Abstraction Productivity

17 Matlab Not object oriented No unified form of code Hard for Encapsulation ( 难以封装 ) Interface Commercial

18 Python Efficiency Script Great Language Easy for learning API is provided

19 COPT C++ Open Optimization Library Created in China Proposed by the Society of Mathematical Programming Developed by MathU

20 COPT Designer: Ruimin Wang Bachelor degree in USTC in 2011 PhD candidate in USTC since 2011 Academic experience Decoupling features and noises via analysis based compressed sensing (2012) Shape modeling by drawing (2012) Point based differential computation (2013) Manifold construction via dictionary learning (2013) Sparse representation with parameterization optimization (2014) Sparsity in geometry (2014)

21 COPT C++ based open source library A lot of templates are used for flexibility An important feature of C++ Python interface is provided Great for novel user

22 COPT Brief Introduction Carefully designed basic types Array, VectorBase, MatrixBase ScalarFunction, VectorFunction Solver Other people can extend by deriving the types Some algorithms been implemented Least squares BFGS

23 A Simple Example Define the scalar type

24 A Simple Example Define the scalar type Define the Array, basic class for vector and matrix

25 A Simple Example Define the scalar type Define the Array, basic class for vector and matrix Define the Vector and Matrix

26 Operations

27 Operations Array like assignment Matlab like assignment is also allowed: like vec1(0)=1

28 Operations

29 Operations

30 Operations

31 Operations Output:

32 Operations

33 Operations Pre defined special matrix

34 Operations

35 Operations Solving linear system

36 Operations

37 COPT What have been done: A friendly designed interface Clear base class Basic operations Linear algebra Function differential (numerical) The interface of a solver

38 COPT Focus An easy to code developing framework Cross platform consideration Linux: Ubuntu Windows Max OS X Developing environment OS X Yosemite with clang MinGW on windows with g++ IDE independent

39 Dependency Classical libraries for linear operations: Blas (fortran), cblas(c), lapack(fortran) C++ template library linear algebra Eigen (maybe temporary)

40 IDE independent Integrated Development Environment( 集成开发环境 ) Visual studio Qt Creator Xcode Compiling details are ignored Link

41 IDE independent Integrated Development Environment( 集成开发环境 ) Visual studio Qt Creator Xcode Compiling details are ignored Link

42 IDE independent Still un familiar with C++ compiling Focus on code not project Light weight development

43 GitHub GitHub isa Git repository web based hosting service. It offers all of the distributed revision control and source code management. It provides a web based graphical interface and desktop.

44 A Simple Example Nonlinear optimization Steepest descent method Newton s Method Quasi Newton Method (like BFGS) A famous 2 dimensional test function Rosenbrock function f (x) x 2 x x 2 1

45 A Simple Example

46 A Simple Example

47 A Simple Example

48 A Simple Example

49 Stuff Students in MathU: Ruimin Wang, Songtao Guo, Jingyuan Hu, Baiyu Chen,

50 More Interface provided for Python Done by Songtao Guo

51 More Unified definition of function A base class is defined Automatically differential computation Many algorithms have not been implemented yet Constrained non linear optimization Large scale solvers: interior point method, alternating direction method of multipliers

52 More COPT v0.1 will be published before Jan for developers only Still a lot of remaining work Everyone is welcomed A very interesting project A good opportunity to challenge yourself

53 Join Us!

6 BLAS (Basic Linear Algebra Subroutines)

6 BLAS (Basic Linear Algebra Subroutines) 161 BLAS 6.1 Motivation 6 BLAS (Basic Linear Algebra Subroutines) 6.1 Motivation How to optimise programs that use a lot of linear algebra operations? Efficiency depends on but also on: processor speed

More information

Introduction to Design Optimization

Introduction to Design Optimization Introduction to Design Optimization First Edition Krishnan Suresh i Dedicated to my family. They mean the world to me. ii Origins of this Text Preface Like many other textbooks, this text has evolved from

More information

Nonlinear optimization in Eigen

Nonlinear optimization in Eigen InModelia http://www.inmodelia.com Eigen Meeting February 20th, 2010 1 Purposes - InModelia needs 2 3 4 It all started from InModelia needs with respect to numerical processing. Our software is written

More information

Day 15: Science Code in Python

Day 15: Science Code in Python Day 15: Science Code in Python 1 Turn In Homework 2 Homework Review 3 Science Code in Python? 4 Custom Code vs. Off-the-Shelf Trade-offs Costs (your time vs. your $$$) Your time (coding vs. learning) Control

More information

Optimization. Industrial AI Lab.

Optimization. Industrial AI Lab. Optimization Industrial AI Lab. Optimization An important tool in 1) Engineering problem solving and 2) Decision science People optimize Nature optimizes 2 Optimization People optimize (source: http://nautil.us/blog/to-save-drowning-people-ask-yourself-what-would-light-do)

More information

Contents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited.

Contents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited. page v Preface xiii I Basics 1 1 Optimization Models 3 1.1 Introduction... 3 1.2 Optimization: An Informal Introduction... 4 1.3 Linear Equations... 7 1.4 Linear Optimization... 10 Exercises... 12 1.5

More information

5 Machine Learning Abstractions and Numerical Optimization

5 Machine Learning Abstractions and Numerical Optimization Machine Learning Abstractions and Numerical Optimization 25 5 Machine Learning Abstractions and Numerical Optimization ML ABSTRACTIONS [some meta comments on machine learning] [When you write a large computer

More information

A Brief Look at Optimization

A Brief Look at Optimization A Brief Look at Optimization CSC 412/2506 Tutorial David Madras January 18, 2018 Slides adapted from last year s version Overview Introduction Classes of optimization problems Linear programming Steepest

More information

NAG at Manchester. Michael Croucher (University of Manchester)

NAG at Manchester. Michael Croucher (University of Manchester) NAG at Manchester Michael Croucher (University of Manchester) Michael.Croucher@manchester.ac.uk www.walkingrandomly.com Twitter: @walkingrandomly My background PhD Computational Physics from Sheffield

More information

Today. Golden section, discussion of error Newton s method. Newton s method, steepest descent, conjugate gradient

Today. Golden section, discussion of error Newton s method. Newton s method, steepest descent, conjugate gradient Optimization Last time Root finding: definition, motivation Algorithms: Bisection, false position, secant, Newton-Raphson Convergence & tradeoffs Example applications of Newton s method Root finding in

More information

APPLIED OPTIMIZATION WITH MATLAB PROGRAMMING

APPLIED OPTIMIZATION WITH MATLAB PROGRAMMING APPLIED OPTIMIZATION WITH MATLAB PROGRAMMING Second Edition P. Venkataraman Rochester Institute of Technology WILEY JOHN WILEY & SONS, INC. CONTENTS PREFACE xiii 1 Introduction 1 1.1. Optimization Fundamentals

More information

Python Scripting for Computational Science

Python Scripting for Computational Science Hans Petter Langtangen Python Scripting for Computational Science Third Edition With 62 Figures 43 Springer Table of Contents 1 Introduction... 1 1.1 Scripting versus Traditional Programming... 1 1.1.1

More information

Optimal Control Techniques for Dynamic Walking

Optimal Control Techniques for Dynamic Walking Optimal Control Techniques for Dynamic Walking Optimization in Robotics & Biomechanics IWR, University of Heidelberg Presentation partly based on slides by Sebastian Sager, Moritz Diehl and Peter Riede

More information

6 Initializing Abstract Models with Data Command Files Model Data The set Command Simple Sets... 68

6 Initializing Abstract Models with Data Command Files Model Data The set Command Simple Sets... 68 Contents 1 Introduction 1 1.1 Mathematical Modeling........................ 1 1.2 Modeling Languages for Optimization................ 3 1.3 Modeling Graph Coloring....................... 4 1.4 Motivating

More information

Preface. and Its Applications 81, ISBN , doi: / , Springer Science+Business Media New York, 2013.

Preface. and Its Applications 81, ISBN , doi: / , Springer Science+Business Media New York, 2013. Preface This book is for all those interested in using the GAMS technology for modeling and solving complex, large-scale, continuous nonlinear optimization problems or applications. Mainly, it is a continuation

More information

Python Scripting for Computational Science

Python Scripting for Computational Science Hans Petter Langtangen Python Scripting for Computational Science Third Edition With 62 Figures Sprin ger Table of Contents 1 Introduction 1 1.1 Scripting versus Traditional Programming 1 1.1.1 Why Scripting

More information

SDLS: a Matlab package for solving conic least-squares problems

SDLS: a Matlab package for solving conic least-squares problems SDLS: a Matlab package for solving conic least-squares problems Didier Henrion 1,2 Jérôme Malick 3 June 28, 2007 Abstract This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares)

More information

Convex and Distributed Optimization. Thomas Ropars

Convex and Distributed Optimization. Thomas Ropars >>> Presentation of this master2 course Convex and Distributed Optimization Franck Iutzeler Jérôme Malick Thomas Ropars Dmitry Grishchenko from LJK, the applied maths and computer science laboratory and

More information

Intel Math Kernel Library 10.3

Intel Math Kernel Library 10.3 Intel Math Kernel Library 10.3 Product Brief Intel Math Kernel Library 10.3 The Flagship High Performance Computing Math Library for Windows*, Linux*, and Mac OS* X Intel Math Kernel Library (Intel MKL)

More information

OPTIMIZATION FOR AUTOMATIC HISTORY MATCHING

OPTIMIZATION FOR AUTOMATIC HISTORY MATCHING INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 2, Supp, Pages 131 137 c 2005 Institute for Scientific Computing and Information OPTIMIZATION FOR AUTOMATIC HISTORY MATCHING Abstract. SHUGUANG

More information

25. NLP algorithms. ˆ Overview. ˆ Local methods. ˆ Constrained optimization. ˆ Global methods. ˆ Black-box methods.

25. NLP algorithms. ˆ Overview. ˆ Local methods. ˆ Constrained optimization. ˆ Global methods. ˆ Black-box methods. CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 25. NLP algorithms ˆ Overview ˆ Local methods ˆ Constrained optimization ˆ Global methods ˆ Black-box methods ˆ Course wrap-up Laurent Lessard

More information

B.Sc. & B.Sc. (Hons) with Major in Applied Mathematics

B.Sc. & B.Sc. (Hons) with Major in Applied Mathematics B.Sc. & B.Sc. (Hons) with Major in Applied Mathematics Graduation Requirements for students admitted in AY2017/18 or after To be awarded a B.Sc. or B.Sc.(Hons) with primary major in Applied Mathematics,

More information

THE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECH- NOLOGY ITERATIVE LINEAR SOLVERS

THE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECH- NOLOGY ITERATIVE LINEAR SOLVERS ITERATIVE LIEAR SOLVERS. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of iterative methods for solving linear least squares problems, to study the properties

More information

MA400: Financial Mathematics

MA400: Financial Mathematics MA400: Financial Mathematics Introductory Course Lecture 1: Overview of the course Preliminaries A brief introduction Beginning to program Some example programs Aims of this course Students should have

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE MANAGEMENT COLLEGE First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and

More information

STA141C: Big Data & High Performance Statistical Computing

STA141C: Big Data & High Performance Statistical Computing STA141C: Big Data & High Performance Statistical Computing Lecture 0: Course information Cho-Jui Hsieh UC Davis April 3, 2018 Course Information Website: http://www.stat.ucdavis.edu/~chohsieh/teaching/

More information

Table of Contents. Introduction.*.. 7. Part /: Getting Started With MATLAB 5. Chapter 1: Introducing MATLAB and Its Many Uses 7

Table of Contents. Introduction.*.. 7. Part /: Getting Started With MATLAB 5. Chapter 1: Introducing MATLAB and Its Many Uses 7 MATLAB Table of Contents Introduction.*.. 7 About This Book 1 Foolish Assumptions 2 Icons Used in This Book 3 Beyond the Book 3 Where to Go from Here 4 Part /: Getting Started With MATLAB 5 Chapter 1:

More information

Practical Course WS 2010 Simultaneous Localization and Mapping

Practical Course WS 2010 Simultaneous Localization and Mapping Practical Course WS 2010 Simultaneous Localization and Mapping Cyrill Stachniss University of Freiburg, Germany Topics of this Course SLAM - simultaneous localization and mapping What does the world look

More information

Classical Gradient Methods

Classical Gradient Methods Classical Gradient Methods Note simultaneous course at AMSI (math) summer school: Nonlin. Optimization Methods (see http://wwwmaths.anu.edu.au/events/amsiss05/) Recommended textbook (Springer Verlag, 1999):

More information

An Iteratively Reweighted Least Square Implementation for Face Recognition

An Iteratively Reweighted Least Square Implementation for Face Recognition Vol. 6: 26-32 THE UNIVERSITY OF CENTRAL FLORIDA Published May 15, 2012 An Iteratively Reweighted Least Square Implementation for Face Recognition By: Jie Liang Faculty Mentor: Dr. Xin Li ABSTRACT: We propose,

More information

OPTIMIZATION METHODS

OPTIMIZATION METHODS D. Nagesh Kumar Associate Professor Department of Civil Engineering, Indian Institute of Science, Bangalore - 50 0 Email : nagesh@civil.iisc.ernet.in URL: http://www.civil.iisc.ernet.in/~nagesh Brief Contents

More information

Process Agnostic Library Migration Automation

Process Agnostic Library Migration Automation Need for Speed: Process Agnostic Library Migration Automation Joseph Murray Lijun Li Outline Motivation Approach PyCell Studio Cadence SKILL Comparison Summary Why Process Agnostic Migration Automation

More information

COUPLING TRNSYS AND MATLAB FOR GENETIC ALGORITHM OPTIMIZATION IN SUSTAINABLE BUILDING DESIGN

COUPLING TRNSYS AND MATLAB FOR GENETIC ALGORITHM OPTIMIZATION IN SUSTAINABLE BUILDING DESIGN COUPLING TRNSYS AND MATLAB FOR GENETIC ALGORITHM OPTIMIZATION IN SUSTAINABLE BUILDING DESIGN Marcus Jones Vienna University of Technology, Vienna, Austria ABSTRACT Incorporating energy efficient features

More information

SimTK 1.5 Workshop Installation and Components. Jack Middleton September 25, 2008

SimTK 1.5 Workshop Installation and Components. Jack Middleton September 25, 2008 SimTK 1.5 Workshop Installation and Components Jack Middleton September 25, 2008 SimTKcore Webpage overview Overview of download contents Help with installs and compiling examples during break SimTKcore

More information

A Short History of Array Computing in Python. Wolf Vollprecht, PyParis 2018

A Short History of Array Computing in Python. Wolf Vollprecht, PyParis 2018 A Short History of Array Computing in Python Wolf Vollprecht, PyParis 2018 TOC - - Array computing in general History up to NumPy Libraries after NumPy - Pure Python libraries - JIT / AOT compilers - Deep

More information

Parallel Unsupervised Feature Learning with Sparse AutoEncoder

Parallel Unsupervised Feature Learning with Sparse AutoEncoder Parallel Unsupervised Feature Learning with Sparse AutoEncoder Milinda Lakkam, Siranush Sarkizova {milindal, sisis}@stanford.edu December 10, 2010 1 Introduction and Motivation Choosing the right input

More information

IE598 Big Data Optimization Summary Nonconvex Optimization

IE598 Big Data Optimization Summary Nonconvex Optimization IE598 Big Data Optimization Summary Nonconvex Optimization Instructor: Niao He April 16, 2018 1 This Course Big Data Optimization Explore modern optimization theories, algorithms, and big data applications

More information

Free Software Alternatives to Commercial Math Software

Free Software Alternatives to Commercial Math Software Free Software Alternatives to Commercial Math Software Fermin Franco フランコフェルミーン Ph.D. Student Faculty of Mathematics, Kyushu University Poster A7 1 Abstract Research in mathematics relies ever more heavily

More information

User System of Astrogeology Technologies (USAT) Team Inventory. CS486C Senior Capstone Project

User System of Astrogeology Technologies (USAT) Team Inventory. CS486C Senior Capstone Project User System of Astrogeology Technologies (USAT) Team Inventory CS486C Senior Capstone Project Mikal Ustad, Kyle Andrew McGinn, Zack Ellett, Megan Backus 1/25/2012 This document introduces: the team members

More information

Intel Performance Libraries

Intel Performance Libraries Intel Performance Libraries Powerful Mathematical Library Intel Math Kernel Library (Intel MKL) Energy Science & Research Engineering Design Financial Analytics Signal Processing Digital Content Creation

More information

The flare Package for High Dimensional Linear Regression and Precision Matrix Estimation in R

The flare Package for High Dimensional Linear Regression and Precision Matrix Estimation in R Journal of Machine Learning Research 6 (205) 553-557 Submitted /2; Revised 3/4; Published 3/5 The flare Package for High Dimensional Linear Regression and Precision Matrix Estimation in R Xingguo Li Department

More information

C++ for CMEA II. Kjetil Olsen Lye. September 24, 2015

C++ for CMEA II. Kjetil Olsen Lye. September 24, 2015 C++ for CMEA II Kjetil Olsen Lye September 24, 2015 C++ in CMEA II Focus of the course is not C++ However, all programming exercises will be in C++ C++ is very relevant for later studies Loads of use cases

More information

THE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS

THE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS METAHEURISTICS 1. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of evolutionary computation techniques and other metaheuristics for solving various global optimization

More information

SDPLR 1.03-beta User s Guide (short version)

SDPLR 1.03-beta User s Guide (short version) SDPLR 3-beta User s Guide (short version) August 12, 2009 1 Summary SDPLR is a C software package for solving large-scale semidefinite programming problems. Source code, binaries, and a Matlab interface

More information

IE521 Convex Optimization Introduction

IE521 Convex Optimization Introduction IE521 Convex Optimization Introduction Instructor: Niao He Jan 18, 2017 1 About Me Assistant Professor, UIUC, 2016 Ph.D. in Operations Research, M.S. in Computational Sci. & Eng. Georgia Tech, 2010 2015

More information

Nonlinear Dimensionality Reduction Applied to the Classification of Images

Nonlinear Dimensionality Reduction Applied to the Classification of Images onlinear Dimensionality Reduction Applied to the Classification of Images Student: Chae A. Clark (cclark8 [at] math.umd.edu) Advisor: Dr. Kasso A. Okoudjou (kasso [at] math.umd.edu) orbert Wiener Center

More information

Theoretical Concepts of Machine Learning

Theoretical Concepts of Machine Learning Theoretical Concepts of Machine Learning Part 2 Institute of Bioinformatics Johannes Kepler University, Linz, Austria Outline 1 Introduction 2 Generalization Error 3 Maximum Likelihood 4 Noise Models 5

More information

SDLS: a Matlab package for solving conic least-squares problems

SDLS: a Matlab package for solving conic least-squares problems SDLS: a Matlab package for solving conic least-squares problems Didier Henrion, Jérôme Malick To cite this version: Didier Henrion, Jérôme Malick. SDLS: a Matlab package for solving conic least-squares

More information

Fast-Lipschitz Optimization

Fast-Lipschitz Optimization Fast-Lipschitz Optimization DREAM Seminar Series University of California at Berkeley September 11, 2012 Carlo Fischione ACCESS Linnaeus Center, Electrical Engineering KTH Royal Institute of Technology

More information

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization

More information

GUIDE Development tools for Windows(10) installation... 2

GUIDE Development tools for Windows(10) installation... 2 GUIDE Development tools for Windows(10) installation... 2 C\C++ compiler and CMake installation... 2 Mingw download... 2 Mingw installation... 3 Adding Mingw compilers folder to PATH variable... 7 CMake

More information

Realization of Time Synchronization Server Based on C/S

Realization of Time Synchronization Server Based on C/S Computer System Networking and Telecommunications Original Research Article Realization of Time Synchronization Server Based on C/S Jidong Zhou,Yanyan Zheng,Yonghui Guo School of Computer and Information,

More information

Introduction to Optimization

Introduction to Optimization Introduction to Optimization Second Order Optimization Methods Marc Toussaint U Stuttgart Planned Outline Gradient-based optimization (1st order methods) plain grad., steepest descent, conjugate grad.,

More information

Large-scale workflows for wave-equation based inversion in Julia

Large-scale workflows for wave-equation based inversion in Julia Large-scale workflows for wave-equation based inversion in Julia Philipp A. Witte, Mathias Louboutin and Felix J. Herrmann SLIM University of British Columbia Motivation Use Geophysics to understand the

More information

The Course Structure for the MCA Programme

The Course Structure for the MCA Programme The Course Structure for the MCA Programme SEMESTER - I MCA 1001 Problem Solving and Program Design with C 3 (3-0-0) MCA 1003 Numerical & Statistical Methods 4 (3-1-0) MCA 1007 Discrete Mathematics 3 (3-0-0)

More information

Fundamentals of Integer Programming

Fundamentals of Integer Programming Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer

More information

LESSON. Bigger and Bigger. Years 5 to 9. Enlarging Figures to Construct Polyhedra Nets

LESSON. Bigger and Bigger. Years 5 to 9. Enlarging Figures to Construct Polyhedra Nets LESSON 4 Bigger and Bigger Years 5 to 9 Enlarging Figures to Construct Polyhedra Nets This lesson involves students using their MATHOMAT to enlarge regular polygons to produce nets of selected polyhedra,

More information

EE/AA 578: Convex Optimization

EE/AA 578: Convex Optimization EE/AA 578: Convex Optimization Instructor: Maryam Fazel University of Washington Fall 2016 1. Introduction EE/AA 578, Univ of Washington, Fall 2016 course logistics mathematical optimization least-squares;

More information

From Theory to Application (Optimization and Optimal Control in Space Applications)

From Theory to Application (Optimization and Optimal Control in Space Applications) From Theory to Application (Optimization and Optimal Control in Space Applications) Christof Büskens Optimierung & Optimale Steuerung 02.02.2012 The paradox of mathematics If mathematics refer to reality,

More information

1. Introduction. performance of numerical methods. complexity bounds. structural convex optimization. course goals and topics

1. Introduction. performance of numerical methods. complexity bounds. structural convex optimization. course goals and topics 1. Introduction EE 546, Univ of Washington, Spring 2016 performance of numerical methods complexity bounds structural convex optimization course goals and topics 1 1 Some course info Welcome to EE 546!

More information

Introduction to Multi-body Dynamics

Introduction to Multi-body Dynamics division Graduate Course ME 244) Tentative Draft Syllabus 1. Basic concepts in 3-D rigid-body mechanics 1. Rigid body vs flexible body 2. Spatial kinematics (3-D rotation transformations) and Euler theorem

More information

MOSEK Optimization Suite

MOSEK Optimization Suite MOSEK Optimization Suite Release 8.1.0.72 MOSEK ApS 2018 CONTENTS 1 Overview 1 2 Interfaces 5 3 Remote optimization 11 4 Contact Information 13 i ii CHAPTER ONE OVERVIEW The problem minimize 1x 1 + 2x

More information

Q. Wang National Key Laboratory of Antenna and Microwave Technology Xidian University No. 2 South Taiba Road, Xi an, Shaanxi , P. R.

Q. Wang National Key Laboratory of Antenna and Microwave Technology Xidian University No. 2 South Taiba Road, Xi an, Shaanxi , P. R. Progress In Electromagnetics Research Letters, Vol. 9, 29 38, 2009 AN IMPROVED ALGORITHM FOR MATRIX BANDWIDTH AND PROFILE REDUCTION IN FINITE ELEMENT ANALYSIS Q. Wang National Key Laboratory of Antenna

More information

Sampling Using GPU Accelerated Sparse Hierarchical Models

Sampling Using GPU Accelerated Sparse Hierarchical Models Sampling Using GPU Accelerated Sparse Hierarchical Models Miroslav Stoyanov Oak Ridge National Laboratory supported by Exascale Computing Project (ECP) exascaleproject.org April 9, 28 Miroslav Stoyanov

More information

Newton and Quasi-Newton Methods

Newton and Quasi-Newton Methods Lab 17 Newton and Quasi-Newton Methods Lab Objective: Newton s method is generally useful because of its fast convergence properties. However, Newton s method requires the explicit calculation of the second

More information

CONLIN & MMA solvers. Pierre DUYSINX LTAS Automotive Engineering Academic year

CONLIN & MMA solvers. Pierre DUYSINX LTAS Automotive Engineering Academic year CONLIN & MMA solvers Pierre DUYSINX LTAS Automotive Engineering Academic year 2018-2019 1 CONLIN METHOD 2 LAY-OUT CONLIN SUBPROBLEMS DUAL METHOD APPROACH FOR CONLIN SUBPROBLEMS SEQUENTIAL QUADRATIC PROGRAMMING

More information

STRUCTURAL & MULTIDISCIPLINARY OPTIMIZATION

STRUCTURAL & MULTIDISCIPLINARY OPTIMIZATION STRUCTURAL & MULTIDISCIPLINARY OPTIMIZATION Pierre DUYSINX Patricia TOSSINGS Department of Aerospace and Mechanical Engineering Academic year 2018-2019 1 Course objectives To become familiar with the introduction

More information

M. Sc. (Artificial Intelligence and Machine Learning)

M. Sc. (Artificial Intelligence and Machine Learning) Course Name: Advanced Python Course Code: MSCAI 122 This course will introduce students to advanced python implementations and the latest Machine Learning and Deep learning libraries, Scikit-Learn and

More information

A MATLAB Interface to the GPU

A MATLAB Interface to the GPU A MATLAB Interface to the GPU Second Winter School Geilo, Norway André Rigland Brodtkorb SINTEF ICT Department of Applied Mathematics 2007-01-24 Outline 1 Motivation and previous

More information

A Comparative Study of Frequency-domain Finite Element Updating Approaches Using Different Optimization Procedures

A Comparative Study of Frequency-domain Finite Element Updating Approaches Using Different Optimization Procedures A Comparative Study of Frequency-domain Finite Element Updating Approaches Using Different Optimization Procedures Xinjun DONG 1, Yang WANG 1* 1 School of Civil and Environmental Engineering, Georgia Institute

More information

LANCELOT naive, a simple interface for LANCELOT B by N. I. M. Gould 1, D. Orban 2 and Ph. L. Toint 3 Report 07/12 26th November 2007

LANCELOT naive, a simple interface for LANCELOT B by N. I. M. Gould 1, D. Orban 2 and Ph. L. Toint 3 Report 07/12 26th November 2007 LANCELOT naive, a simple interface for LANCELOT B by N. I. M. Gould 1, D. Orban 2 and Ph. L. Toint 3 Report 07/12 26th November 2007 1 Oxford University Computing Laboratory, Wolfson Building, Parks Road,

More information

Python, SageMath/Cloud, R and Open-Source

Python, SageMath/Cloud, R and Open-Source Python, SageMath/Cloud, R and Open-Source Harald Schilly 2016-10-14 TANCS Workshop Institute of Physics University Graz The big picture The Big Picture Software up to the end of 1979: Fortran: LINPACK

More information

StochDynamicProgramming.jl : a Julia package for multistage stochastic optimization.

StochDynamicProgramming.jl : a Julia package for multistage stochastic optimization. StochDynamicProgramming.jl : a Julia package for multistage stochastic optimization. V. Leclère, H. Gerard, F. Pacaud, T. Rigaut July 6, 2016 V. Leclère SDDP package July 6, 2016 1 / 14 Contents 1 Some

More information

Expected to have Knowledge in these Undergraduate Level Core Courses

Expected to have Knowledge in these Undergraduate Level Core Courses Expected to have Knowledge in these Undergraduate Level Core Courses ECEN 3810 Intro to Probability ECEN 4242 Communication Theory ECEN 4632 Intro to Digital Filtering Graduate Level Core Courses in ECEE

More information

Dynamic Selection of Auto-tuned Kernels to the Numerical Libraries in the DOE ACTS Collection

Dynamic Selection of Auto-tuned Kernels to the Numerical Libraries in the DOE ACTS Collection Numerical Libraries in the DOE ACTS Collection The DOE ACTS Collection SIAM Parallel Processing for Scientific Computing, Savannah, Georgia Feb 15, 2012 Tony Drummond Computational Research Division Lawrence

More information

Scalable Machine Learning in R. with H2O

Scalable Machine Learning in R. with H2O Scalable Machine Learning in R with H2O Erin LeDell @ledell DSC July 2016 Introduction Statistician & Machine Learning Scientist at H2O.ai in Mountain View, California, USA Ph.D. in Biostatistics with

More information

Modern Methods of Data Analysis - WS 07/08

Modern Methods of Data Analysis - WS 07/08 Modern Methods of Data Analysis Lecture XV (04.02.08) Contents: Function Minimization (see E. Lohrmann & V. Blobel) Optimization Problem Set of n independent variables Sometimes in addition some constraints

More information

Robust Principal Component Analysis (RPCA)

Robust Principal Component Analysis (RPCA) Robust Principal Component Analysis (RPCA) & Matrix decomposition: into low-rank and sparse components Zhenfang Hu 2010.4.1 reference [1] Chandrasekharan, V., Sanghavi, S., Parillo, P., Wilsky, A.: Ranksparsity

More information

Using the NAG C Library in C/C++

Using the NAG C Library in C/C++ Using the NAG C Library in C/C++ Making it Easier to Write Financial Applications Jacques du Toit, NAG Experts in numerical algorithms and HPC services OVERVIEW OF NAG Experts in numerical algorithms and

More information

Preparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers

Preparation Meeting. Recent Advances in the Analysis of 3D Shapes. Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers Preparation Meeting Recent Advances in the Analysis of 3D Shapes Emanuele Rodolà Matthias Vestner Thomas Windheuser Daniel Cremers What You Will Learn in the Seminar Get an overview on state of the art

More information

A Novel Image Super-resolution Reconstruction Algorithm based on Modified Sparse Representation

A Novel Image Super-resolution Reconstruction Algorithm based on Modified Sparse Representation , pp.162-167 http://dx.doi.org/10.14257/astl.2016.138.33 A Novel Image Super-resolution Reconstruction Algorithm based on Modified Sparse Representation Liqiang Hu, Chaofeng He Shijiazhuang Tiedao University,

More information

Using Existing Numerical Libraries on Spark

Using Existing Numerical Libraries on Spark Using Existing Numerical Libraries on Spark Brian Spector Chicago Spark Users Meetup June 24 th, 2015 Experts in numerical algorithms and HPC services How to use existing libraries on Spark Call algorithm

More information

Algebraic Iterative Methods for Computed Tomography

Algebraic Iterative Methods for Computed Tomography Algebraic Iterative Methods for Computed Tomography Per Christian Hansen DTU Compute Department of Applied Mathematics and Computer Science Technical University of Denmark Per Christian Hansen Algebraic

More information

Hartley - Zisserman reading club. Part I: Hartley and Zisserman Appendix 6: Part II: Zhengyou Zhang: Presented by Daniel Fontijne

Hartley - Zisserman reading club. Part I: Hartley and Zisserman Appendix 6: Part II: Zhengyou Zhang: Presented by Daniel Fontijne Hartley - Zisserman reading club Part I: Hartley and Zisserman Appendix 6: Iterative estimation methods Part II: Zhengyou Zhang: A Flexible New Technique for Camera Calibration Presented by Daniel Fontijne

More information

Full Stack Web Developer Nanodegree Syllabus

Full Stack Web Developer Nanodegree Syllabus Full Stack Web Developer Nanodegree Syllabus Build Complex Web Applications Before You Start Thank you for your interest in the Full Stack Web Developer Nanodegree! In order to succeed in this program,

More information

Oracle Developer Studio 12.6

Oracle Developer Studio 12.6 Oracle Developer Studio 12.6 Oracle Developer Studio is the #1 development environment for building C, C++, Fortran and Java applications for Oracle Solaris and Linux operating systems running on premises

More information

Function call overhead benchmarks with MATLAB, Octave, Python, Cython and C

Function call overhead benchmarks with MATLAB, Octave, Python, Cython and C Function call overhead benchmarks with MATLAB, Octave, Python, Cython and C André Gaul September 23, 2018 arxiv:1202.2736v1 [cs.pl] 13 Feb 2012 1 Background In many applications a function has to be called

More information

ECE 3574: Applied Software Design

ECE 3574: Applied Software Design ECE 3574: Applied Software Design Chris Wyatt Spring 2018 Welcome to ECE 3574: Applied Software Design CRN 19016 Website: https://filebox.ece.vt.edu/~ece3574 Instructor: Chris Wyatt, clwyatt@vt.edu Today

More information

Goals for this lecture. Lecture 4 Getting Started with ITK! Getting help. Assignments. Assignments, cont. Grading of assignments

Goals for this lecture. Lecture 4 Getting Started with ITK! Getting help. Assignments. Assignments, cont. Grading of assignments Goals for this lecture Lecture 4 Getting Started with ITK! Methods in Medical Image Analysis - Spring 2018 16-725 (CMU RI) : BioE 2630 (Pitt) Dr. John Galeotti Compile, compile, compile Learn how to use

More information

Introduction to optimization methods and line search

Introduction to optimization methods and line search Introduction to optimization methods and line search Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi How to find optimal solutions? Trial and error widely used in practice, not efficient and

More information

Spring 2017 FRE-GY 6883 Financial Computing Song Tang, Ph.D

Spring 2017 FRE-GY 6883 Financial Computing Song Tang, Ph.D Spring 2017 FRE-GY 6883 Financial Computing Song Tang, Ph.D. st290@nyu.edu, 646-283-4578 Overview: This course covers programming applications to financial engineering, including C++ and Java and the various

More information

Nonlinear Programming

Nonlinear Programming Nonlinear Programming SECOND EDITION Dimitri P. Bertsekas Massachusetts Institute of Technology WWW site for book Information and Orders http://world.std.com/~athenasc/index.html Athena Scientific, Belmont,

More information

Introduction to LLVM. UG3 Compiling Techniques Autumn 2018

Introduction to LLVM. UG3 Compiling Techniques Autumn 2018 Introduction to LLVM UG3 Compiling Techniques Autumn 2018 Contact Information Instructor: Aaron Smith Email: aaron.l.smith@ed.ac.uk Office: IF 1.29 TA for LLVM: Andrej Ivanis Email: andrej.ivanis@ed.ac.uk

More information

Chapter 1. Math review. 1.1 Some sets

Chapter 1. Math review. 1.1 Some sets Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric

More information

Machine Learning and Data Mining. Clustering (1): Basics. Kalev Kask

Machine Learning and Data Mining. Clustering (1): Basics. Kalev Kask Machine Learning and Data Mining Clustering (1): Basics Kalev Kask Unsupervised learning Supervised learning Predict target value ( y ) given features ( x ) Unsupervised learning Understand patterns of

More information

Team Inventory. Team: Nimbus Technology Sponsor: IBM. Faculty Mentor: Austin Sanders

Team Inventory. Team: Nimbus Technology Sponsor: IBM. Faculty Mentor: Austin Sanders Team Inventory Team: Nimbus Technology Sponsor: IBM Faculty Mentor: Austin Sanders Team Members: Itreau Bigsby Matthew Cocchi Richard Riley Deen Benjamin George Overview The purpose of this document is

More information

Face Recognition Using Long Haar-like Filters

Face Recognition Using Long Haar-like Filters Face Recognition Using Long Haar-like Filters Y. Higashijima 1, S. Takano 1, and K. Niijima 1 1 Department of Informatics, Kyushu University, Japan. Email: {y-higasi, takano, niijima}@i.kyushu-u.ac.jp

More information

Lecture 9. Introduction to Numerical Techniques

Lecture 9. Introduction to Numerical Techniques Lecture 9. Introduction to Numerical Techniques Ivan Papusha CDS270 2: Mathematical Methods in Control and System Engineering May 27, 2015 1 / 25 Logistics hw8 (last one) due today. do an easy problem

More information

High performance computing and the simplex method

High performance computing and the simplex method Julian Hall, Qi Huangfu and Edmund Smith School of Mathematics University of Edinburgh 12th April 2011 The simplex method for LP Not... Nonlinear programming... Integer programming... Stochastic programming......

More information

Research on Evaluation Method of Product Style Semantics Based on Neural Network

Research on Evaluation Method of Product Style Semantics Based on Neural Network Research Journal of Applied Sciences, Engineering and Technology 6(23): 4330-4335, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: September 28, 2012 Accepted:

More information