A Branch-and-Bound Algorithm for Unconstrained Global Optimization
|
|
- Barbara Cobb
- 5 years ago
- Views:
Transcription
1 SCAN 2010, Lyon, September 27 30, / 18 A Branch-and-Bound Algorithm for Unconstrained Global Optimization Laurent Granvilliers and Alexandre Goldsztejn Université de Nantes LINA CNRS Interval-based BB framework New hybrid algorithm Experiments using Realpaver
2 SCAN 2010, Lyon, September 27 30, / 18 Unconstrained Global Optimization We consider a class C 2 function f : R n R to be minimized a box B R n (bound constraints, search space) We define a global minimizer as an element x B such that x B : f(x ) f(x) the global minimum f = f(x ) for every global minimizer x Our goal is to compute within given tolerances a set of boxes S enclosing the set of all global minimizers an interval [l, u] enclosing f
3 SCAN 2010, Lyon, September 27 30, / 18 Branch-and-Bound Basic principles the initial box B is recursively split into sub-boxes, forming a tree, until given tolerances are reached the best upper bound u of f is maintained the lower bound of f is calculated on every sub-box; this box can be rejected if this lower bound is strictly greater than u Complexity: worst case exponential in the depth of the tree An efficient algorithm requires many other techniques constraint-based reduction methods graph decomposition techniques use of optimality conditions local optimization adaptive splitting techniques
4 SCAN 2010, Lyon, September 27 30, / 18 Interval Enclosures Definition An interval extension of f is an interval function f such that x B : {f(x) : x x} f(x).
5 SCAN 2010, Lyon, September 27 30, / 18 Interval Enclosures Definition An interval extension of f is an interval function f such that x B : {f(x) : x x} f(x). Consider a subdivision {x k } k K of B. f(x k ) We use: natural form mean value form x k
6 Interval Enclosures Definition An interval extension of f is an interval function f such that x B : {f(x) : x x} f(x). Consider a subdivision {x k } k K of B. We have f [l,u] such that: u l min k K f(xk ) u min k K f(xk ) l SCAN 2010, Lyon, September 27 30, / 18 f
7 Interval Enclosures Definition An interval extension of f is an interval function f such that x B : {f(x) : x x} f(x). Consider a subdivision {x k } k K of B. For all x B, f(x) is an upper bound of f. x Improving u leads to reject sub-boxes (basic principle of BB). u f SCAN 2010, Lyon, September 27 30, / 18 l
8 SCAN 2010, Lyon, September 27 30, / 18 Algorithm 1: S % output boxes 2: L { B,f(B) } % boxes to be considered 3: u + % upper bound 4: 5: while L is not empty do 6: x,f(x) pop (L) % box x s.t. f(x) is minimum 7: a Minimize (f, x) % minimization of f within x 8: u min(u,f(a)) % update the upper bound 9: x Contract (x, B, f, u) % use constraints to contract x 10: Branch (x,ε, L, S) % split x if it is large enough 11: update L and S according to u 12: end while 13: 14: l min{f(x) : x,f(x) S} 15: return S,[l,u]
9 SCAN 2010, Lyon, September 27 30, / 18 Branching Step Branch (x,ε, L, S) 1: if x is not empty then 2: if wid(x) ε then 3: S S { x,f(x) } 4: else 5: {x k } k K Split(x,ε) 6: L L { x k,f(x k ) : k K} 7: end if 8: end if Splitting heuristics round robin, largest domain, smear function bisection, trisection
10 SCAN 2010, Lyon, September 27 30, / 18 Minimization Step The goal is to find a minimizer of f within the given box x in order to update the upper bound of f Some techniques local optimization grid-based exploration metaheuristics hybrid methods Our algorithm line search based Newton s method: x 0, x 1, x 2,... such that x k+1 x k α k H(x k ) 1 f(x k ), k 0 greedy strategy with a grid of n points (linear) stopping when the upper bound is not improved enough hybrid algorithm
11 SCAN 2010, Lyon, September 27 30, / 18 Contraction Step Constraints that must be verified by every global minimizer x i. f(x) u ii. x B = f(x) = 0
12 SCAN 2010, Lyon, September 27 30, / 18 Contraction Step Constraints that must be verified by every global minimizer x i. f(x) u ii. x B = f(x) = 0 Contracting operator for a constraint c: x,x B i. θ(x) x ii. x x \ θ(x) : c(x) iii. x x = θ(x) θ(x )
13 SCAN 2010, Lyon, September 27 30, / 18 Contraction Step Constraints that must be verified by every global minimizer x i. f(x) u ii. x B = f(x) = 0 Contracting operator for a constraint c: x,x B i. θ(x) x ii. x x \ θ(x) : c(x) iii. x x = θ(x) θ(x ) Constraint propagation given θ 1,...,θ k : x B ( k ) ω x θ i (x) i=1 Note: greatest common fixed-point of the θ i included in x
14 SCAN 2010, Lyon, September 27 30, / 18 Inequality Constraint f(x) u s.t. f u f(x) = xcos(x) x = [ 5, 5] u = 2 x u f
15 SCAN 2010, Lyon, September 27 30, / 18 Inequality Constraint f(x) u s.t. f u f(x) = xcos(x) θ(x) = [2.4, 4.3] θ(x) Projection onto x 2B consistency box consistency u f
16 SCAN 2010, Lyon, September 27 30, / 18 System of Equations x B = f(x) = 0 f(x) = xcos(x) x = [ 2.7, 4.5] x
17 SCAN 2010, Lyon, September 27 30, / 18 System of Equations x B = f(x) = 0 f(x) = xcos(x) θ(x) = [ 1.2, 3.6] Solving methods interval Newton θ(x) consistency techniques f(x ) = 0
18 SCAN 2010, Lyon, September 27 30, / 18 Experiments Implementation in Realpaver 1.1 (2010) constraint solving and optimization library high-level modeling language interval arithmetic: gaol (F. Goualard) Initial box: [ 10000,1000] n (not centered around 0) Tolerance ε = Time Out (TO) : 600 seconds Processor: Intel Core2 Duo T GHz
19 SCAN 2010, Lyon, September 27 30, / 18 Problems (1) Schwefel function 2 n i i=1 j=1 x i Dixon-Price function n (x 1 1) 2 ( + i (2x 2 i x i 1 ) 2) i=2 polynomial, long narrow valley unimodal polynomial, large valley two global minimizers
20 Problems (2) Griewank function n x 2 i i=1 n ( ) xi cos i i=1 Michalewicz function n ( sin(x i )sin i x2 i π i=1 ) 20 trigonometric, multimodal multimodal, high degree regular distribution of narrow peaks, large valleys minimizers SCAN 2010, Lyon, September 27 30, / 18
21 SCAN 2010, Lyon, September 27 30, / 18 General Results Problem n occ sol u l split time Dixon Price Rosenbrock Schwefel Griewank Michalewicz Rastrigin
22 SCAN 2010, Lyon, September 27 30, / 18 Contraction Step We compare two algorithms for solving f(x) = 0 Full: best algorithm interval Newton method consistency techniques and constraint propagation Newton: only the interval Newton method Problem n Full Newton u l time u l time Dixon Price TO Rosenbrock Schwefel Griewank Michalewicz TO Rastrigin TO
23 SCAN 2010, Lyon, September 27 30, / 18 Minimization Step We compare three algorithms for improving the upper bound Newton descent method (local optimization) Grid-based algorithm Hybrid Grid+Newton Problem n Descent Grid Hybrid Dixon Price Rosenbrock Schwefel TO 1.90 Griewank Michalewicz Rastrigin
24 SCAN 2010, Lyon, September 27 30, / 18 Conclusions Constraint-based contracting techniques are used to enclose precisely and rigorously the global minimizers, resulting in a precise enclosure of the global minimum. Our algorithm is generic, described by an object model, and the components can vary independently from each others, allowing to test easily many combinations interval extension minimization step contraction step branching step Realpaver has been compared with two rigorous solvers: GlobSol (R.B. Kearfott) and icos (Y. Lebbah) the first results show good performances it should also be compared with other solvers
25 SCAN 2010, Lyon, September 27 30, / 18 A Branch-and-Bound Algorithm for Unconstrained Global Optimization Laurent Granvilliers and Alexandre Goldsztejn Université de Nantes LINA CNRS
Deterministic Global Optimization for Dynamic Systems Using Interval Analysis
Deterministic Global Optimization for Dynamic Systems Using Interval Analysis Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame,
More informationGlobal Optimization by Interval Analysis
Global Optimization by Interval Analysis Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/
More informationSolving Global Optimization Problems by Interval Computation
Solving Global Optimization Problems by Interval Computation Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationNumerical Methods. V. Leclère May 15, x R n
Numerical Methods V. Leclère May 15, 2018 1 Some optimization algorithms Consider the unconstrained optimization problem min f(x). (1) x R n A descent direction algorithm is an algorithm that construct
More informationComputational tools for reliable global optimization. Charlie Vanaret, Institut de Recherche en Informatique de Toulouse
Computational tools for reliable global optimization Charlie Vanaret, Institut de Recherche en Informatique de Toulouse INRA, 10 March 2017 Short bio Toulouse, France Sept 2015 - March 2017: postdoctoral
More informationFaster and Tighter Evaluation of a Polynomial Range Through SIMD Interval Arithmetic
Faster and Tighter Evaluation of a Polynomial Range Through SIMD Interval Arithmetic Frédéric Goualard Université de Nantes Laboratoire d Informatique de Nantes-Atlantique, UMR CNRS 6241 Faster and Tighter
More informationVerified Global Optimization with Taylor Model based Range Bounders
Verified Global Optimization with Taylor Model based Range Bounders KYOKO MAKINO and MARTIN BERZ Department of Physics and Astronomy Michigan State University East Lansing, MI 88 USA makino@msu.edu, berz@msu.edu
More informationOptimization. Yuh-Jye Lee. March 21, Data Science and Machine Intelligence Lab National Chiao Tung University 1 / 29
Optimization Yuh-Jye Lee Data Science and Machine Intelligence Lab National Chiao Tung University March 21, 2017 1 / 29 You Have Learned (Unconstrained) Optimization in Your High School Let f (x) = ax
More informationMidterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015
Midterm for Introduction to Numerical Analysis I, AMSC/CMSC 466, on 10/29/2015 The test lasts 1 hour and 15 minutes. No documents are allowed. The use of a calculator, cell phone or other equivalent electronic
More information1. Introduction. We consider the general global optimization problem
CONSTRUCTION OF VALIDATED UNIQUENESS REGIONS FOR NONLINEAR PROGRAMS IN WHICH CONVEX SUBSPACES HAVE BEEN IDENTIFIED R. BAKER KEARFOTT Abstract. In deterministic global optimization algorithms for constrained
More informationSatisfiability Checking
Satisfiability Checking Interval Constraint Propagation Prof. Dr. Erika Ábrahám RWTH Aachen University Informatik 2 LuFG Theory of Hybrid Systems WS 14/15 Satisfiability Checking Prof. Dr. Erika Ábrahám
More informationSpectral gradient projection method for solving nonlinear monotone equations
Journal of Computational and Applied Mathematics 196 (2006) 478 484 www.elsevier.com/locate/cam Spectral gradient projection method for solving nonlinear monotone equations Li Zhang, Weijun Zhou Department
More informationALGEBRA II WITH TRIGONOMETRY EXAM
First Round : March 7, 00 Second Round: April, 00 at The University of Alabama ALGEBRA II WITH TRIGONOMETRY EXAM Construction of this test directed by Congxiao Liu, Alabama A&M University and Alzaki Fadl
More informationMidterm Review. Igor Yanovsky (Math 151A TA)
Midterm Review Igor Yanovsky (Math 5A TA) Root-Finding Methods Rootfinding methods are designed to find a zero of a function f, that is, to find a value of x such that f(x) =0 Bisection Method To apply
More information1 Numerical optimization
Contents 1 Numerical optimization 5 1.1 Optimization of single-variable functions............ 5 1.1.1 Golden Section Search................... 6 1.1. Fibonacci Search...................... 8 1. Algorithms
More informationCalculus. Central role in much of modern science Physics, especially kinematics and electrodynamics Economics, engineering, medicine, chemistry, etc.
Calculus Calculus - the study of change, as related to functions Formally co-developed around the 1660 s by Newton and Leibniz Two main branches - differential and integral Central role in much of modern
More informationThe optimistic principle applied to function optimization
The optimistic principle applied to function optimization Rémi Munos Google DeepMind INRIA Lille, Sequel team LION 9, 2015 The optimistic principle applied to function optimization Optimistic principle:
More informationA Reliable Affine Relaxation Method for Global Optimization
A Reliable Affine Relaxation Method for Global Optimization Jordan Ninin Frédéric Messine Pierre Hansen October 23, 2012 Abstract An automatic method for constructing linear relaxations of constrained
More informationDemo 5. 1 Degree Reduction and Raising Matrices for Degree 5
Demo This demo contains the calculation procedures to generate the results shown in Appendix A of the lab report. Degree Reduction and Raising Matrices for Degree M,4 = 3 4 4 4 3 4 3 4 4 4 3 4 4 M 4, =
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationAlgebra I. Course Outline
Algebra I Course Outline I. The Language of Algebra A. Variables and Expressions B. Order of Operations C. Open Sentences D. Identity and Equality Properties E. The Distributive Property F. Commutative
More information8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0
8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n
More informationSemi-Automatic Floating-Point Implementation of Special Functions
Semi-Automatic Floating-Point Implementation of Special Functions Christoph Lauter 1 Marc Mezzarobba 1,2 Pequan group 1 Université Paris 6 2 CNRS ARITH 22, Lyon, 2015-06-23 }main() { int temp; float celsius;
More information1 Numerical optimization
Contents Numerical optimization 5. Optimization of single-variable functions.............................. 5.. Golden Section Search..................................... 6.. Fibonacci Search........................................
More informationTaylor Model Range Bounding Schemes
Taylor Model Range Bounding Schemes I Kyoko Makino II Martin Berz Department of Physics and Astronomy Michigan State University Introduction LDB (Linear Dominated Bounder) QDB (Quadratic Dominated Bounder)
More informationDevelopment of an algorithm for solving mixed integer and nonconvex problems arising in electrical supply networks
Development of an algorithm for solving mixed integer and nonconvex problems arising in electrical supply networks E. Wanufelle 1 S. Leyffer 2 A. Sartenaer 1 Ph. Toint 1 1 FUNDP, University of Namur 2
More informationBEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations
BEKG 2452 NUMERICAL METHODS Solution of Nonlinear Equations Ser Lee Loh a, Wei Sen Loi a a Fakulti Kejuruteraan Elektrik Universiti Teknikal Malaysia Melaka Lesson Outcome Upon completion of this lesson,
More informationNUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR)
NUMERICAL AND STATISTICAL COMPUTING (MCA-202-CR) Autumn Session UNIT 1 Numerical analysis is the study of algorithms that uses, creates and implements algorithms for obtaining numerical solutions to problems
More informationREVISITING THE UPPER BOUNDING PROCESS IN A SAFE BRANCH AND BOUND ALGORITHM
LABORATOIRE INFORMATIQUE, SIGNAUX ET SYSTÈMES DE SOPHIA ANTIPOLIS UMR 6070 REVISITING THE UPPER BOUNDING PROCESS IN A SAFE BRANCH AND BOUND ALGORITHM Alexandre GOLDSZTEJN, Yahia LEBBAH, Claude MICHEL,
More informationIncreasing and decreasing intervals *
OpenStax-CNX module: m15474 1 Increasing and decreasing intervals * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 A function is
More informationAnalysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort
Analysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort Xi Chen Columbia University We continue with two more asymptotic notation: o( ) and ω( ). Let f (n) and g(n) are functions that map
More informationBeta Damping Quantum Behaved Particle Swarm Optimization
Beta Damping Quantum Behaved Particle Swarm Optimization Tarek M. Elbarbary, Hesham A. Hefny, Atef abel Moneim Institute of Statistical Studies and Research, Cairo University, Giza, Egypt tareqbarbary@yahoo.com,
More informationA New Monotonicity-Based Interval Extension Using Occurrence Grouping
A New Monotonicity-Based Interval Extension Using Occurrence Grouping Ignacio Araya, Bertrand Neveu, Gilles Trombettoni INRIA, University of Nice-Sophia, ENPC Firstname.Name@sophia.inria.fr Abstract. When
More informationEXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS
EXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS JIANWEI DIAN AND R BAKER KEARFOTT Abstract Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous
More informationConvex Optimization. Newton s method. ENSAE: Optimisation 1/44
Convex Optimization Newton s method ENSAE: Optimisation 1/44 Unconstrained minimization minimize f(x) f convex, twice continuously differentiable (hence dom f open) we assume optimal value p = inf x f(x)
More informationA New Monotonicity-Based Interval Extension Using Occurrence Grouping
A New Monotonicity-Based Interval Extension Using Occurrence Grouping Ignacio Araya, Bertrand Neveu, Gilles Trombettoni INRIA, Université de Nice-Sophia, ENPC {Ignacio.Araya,Gilles.Trombettoni,Bertrand.Neveu}@sophia.inria.fr
More informationMath 112 (Calculus I) Midterm Exam 3 KEY
Math 11 (Calculus I) Midterm Exam KEY Multiple Choice. Fill in the answer to each problem on your computer scored answer sheet. Make sure your name, section and instructor are on that sheet. 1. Which of
More information1. Let g(x) and h(x) be polynomials with real coefficients such that
1. Let g(x) and h(x) be polynomials with real coefficients such that g(x)(x 2 3x + 2) = h(x)(x 2 + 3x + 2) and f(x) = g(x)h(x) + (x 4 5x 2 + 4). Prove that f(x) has at least four real roots. 2. Let M be
More informationThe function graphed below is continuous everywhere. The function graphed below is NOT continuous everywhere, it is discontinuous at x 2 and
Section 1.4 Continuity A function is a continuous at a point if its graph has no gaps, holes, breaks or jumps at that point. If a function is not continuous at a point, then we say it is discontinuous
More informationAlgorithms for constrained local optimization
Algorithms for constrained local optimization Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Algorithms for constrained local optimization p. Feasible direction methods Algorithms for constrained
More informationVerified Branch and Bound for Singular Linear and Nonlinear Programs An Epsilon-Inflation Process
Verified Branch and Bound for Singular Linear and Nonlinear Programs An Epsilon-Inflation Process Ralph Baker Kearfott and Julie Roy Received: date / Accepted: date Abstract Linear and nonlinear programs
More informationOptimization. Yuh-Jye Lee. March 28, Data Science and Machine Intelligence Lab National Chiao Tung University 1 / 40
Optimization Yuh-Jye Lee Data Science and Machine Intelligence Lab National Chiao Tung University March 28, 2017 1 / 40 The Key Idea of Newton s Method Let f : R n R be a twice differentiable function
More informationA Library of Functions
LibraryofFunctions.nb 1 A Library of Functions Any study of calculus must start with the study of functions. Functions are fundamental to mathematics. In its everyday use the word function conveys to us
More informationMATH 2053 Calculus I Review for the Final Exam
MATH 05 Calculus I Review for the Final Exam (x+ x) 9 x 9 1. Find the limit: lim x 0. x. Find the limit: lim x + x x (x ).. Find lim x (x 5) = L, find such that f(x) L < 0.01 whenever 0 < x
More informationControlling the Population
Lesson.1 Skills Practice Name Date Controlling the Population Adding and Subtracting Polynomials Vocabulary Match each definition with its corresponding term. 1. polynomial a. a polynomial with only 1
More informationConstraint propagation for univariate quadratic constraints
Constraint propagation for univariate quadratic constraints Arnold Neumaier Institut für Mathematik, Universität Wien Strudlhofgasse 4, A-1090 Wien, Austria email: Arnold.Neumaier@univie.ac.at WWW: http://www.mat.univie.ac.at/
More informationDeterministic Global Optimization of Nonlinear Dynamic Systems
Deterministic Global Optimization of Nonlinear Dynamic Systems Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame, IN 46556, USA
More informationIs the Hénon map chaotic
Is the Hénon map chaotic Zbigniew Galias Department of Electrical Engineering AGH University of Science and Technology, Poland, galias@agh.edu.pl International Workshop on Complex Networks and Applications
More informationTopic 17. Analysis of Algorithms
Topic 17 Analysis of Algorithms Analysis of Algorithms- Review Efficiency of an algorithm can be measured in terms of : Time complexity: a measure of the amount of time required to execute an algorithm
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationSTOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1
53 17. Lecture 17 Nonlinear Equations Essentially, the only way that one can solve nonlinear equations is by iteration. The quadratic formula enables one to compute the roots of p(x) = 0 when p P. Formulas
More informationATHS FC Math Department Al Ain Revision worksheet
ATHS FC Math Department Al Ain Revision worksheet Section Name ID Date Lesson Marks 3.3, 13.1 to 13.6, 5.1, 5.2, 5.3 Lesson 3.3 (Solving Systems of Inequalities by Graphing) Question: 1 Solve each system
More informationAdaptive Differential Evolution and Exponential Crossover
Proceedings of the International Multiconference on Computer Science and Information Technology pp. 927 931 ISBN 978-83-60810-14-9 ISSN 1896-7094 Adaptive Differential Evolution and Exponential Crossover
More informationUNCONSTRAINED OPTIMIZATION
UNCONSTRAINED OPTIMIZATION 6. MATHEMATICAL BASIS Given a function f : R n R, and x R n such that f(x ) < f(x) for all x R n then x is called a minimizer of f and f(x ) is the minimum(value) of f. We wish
More informationMath 160 Final Exam Info and Review Exercises
Math 160 Final Exam Info and Review Exercises Fall 2018, Prof. Beydler Test Info Will cover almost all sections in this class. This will be a 2-part test. Part 1 will be no calculator. Part 2 will be scientific
More informationy = 5 x. Which statement is true? x 2 6x 25 = 0 by completing the square?
Algebra /Trigonometry Regents Exam 064 www.jmap.org 064a Which survey is least likely to contain bias? ) surveying a sample of people leaving a movie theater to determine which flavor of ice cream is the
More informationMA 114 Worksheet # 17: Integration by trig substitution
MA Worksheet # 7: Integration by trig substitution. Conceptual Understanding: Given identity sin θ + cos θ =, prove that: sec θ = tan θ +. Given x = a sin(θ) with a > and π θ π, show that a x = a cos θ.
More informationAP Calculus Summer Homework
Class: Date: AP Calculus Summer Homework Show your work. Place a circle around your final answer. 1. Use the properties of logarithms to find the exact value of the expression. Do not use a calculator.
More informationOutline. Math Numerical Analysis. Intermediate Value Theorem. Lecture Notes Zeros and Roots. Joseph M. Mahaffy,
Outline Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationNONLINEAR. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
NONLINEAR PROGRAMMING (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Nonlinear Programming g Linear programming has a fundamental role in OR. In linear programming all its functions
More informationCHAPTER 11. A Revision. 1. The Computers and Numbers therein
CHAPTER A Revision. The Computers and Numbers therein Traditional computer science begins with a finite alphabet. By stringing elements of the alphabet one after another, one obtains strings. A set of
More informationarxiv: v1 [cs.ne] 29 Jul 2014
A CUDA-Based Real Parameter Optimization Benchmark Ke Ding and Ying Tan School of Electronics Engineering and Computer Science, Peking University arxiv:1407.7737v1 [cs.ne] 29 Jul 2014 Abstract. Benchmarking
More informationAS PURE MATHS REVISION NOTES
AS PURE MATHS REVISION NOTES 1 SURDS A root such as 3 that cannot be written exactly as a fraction is IRRATIONAL An expression that involves irrational roots is in SURD FORM e.g. 2 3 3 + 2 and 3-2 are
More informationComputation of Interval Extensions Using Berz-Taylor Polynomial Models
Computation of Interval Extensions Using Berz-Taylor Polynomial Models Hongkun Liang and Mark A. Stadtherr Λ Department of Chemical Engineering University of Notre Dame Notre Dame, IN 46556 USA AIChE Annual
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... Introduce the topic of numerical methods Consider the Error analysis and sources of errors Introduction A numerical method which
More informationTWO METHODS FOR OF EQUATIONS
TWO METHODS FOR FINDING ROOTS OF EQUATIONS Closed (Bracketing) Methods Open Methods Motivation: i In engineering applications, it is often necessary to determine the rootofan of equation when a formula
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationLearning from Examples
Learning from Examples Data fitting Decision trees Cross validation Computational learning theory Linear classifiers Neural networks Nonparametric methods: nearest neighbor Support vector machines Ensemble
More informationCOURSE Numerical integration of functions
COURSE 6 3. Numerical integration of functions The need: for evaluating definite integrals of functions that has no explicit antiderivatives or whose antiderivatives are not easy to obtain. Let f : [a,
More informationcorrelated to the Indiana Academic Standards for Precalculus CC2
correlated to the Indiana Academic Standards for Precalculus CC2 6/2003 2003 Introduction to Advanced Mathematics 2003 by Richard G. Brown Advanced Mathematics offers comprehensive coverage of precalculus
More informationREGULAR-SS12: The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs
1 2 3 4 REGULAR-SS12: The Bernstein branch-and-prune algorithm for constrained global optimization of multivariate polynomial MINLPs 5 6 7 8 Bhagyesh V. Patil Cambridge Centre for Advanced Research in
More informationApplied Calculus GS1001
1 Applied Calculus GS1001 January 24, 2019 0 Numbers, sets 0.1 numbers natural numbers N (+) (0),1,2,3,... integers Z 3, 2, 1,0,... rational numbers m/n m,n Z n 0 real numbers R complex numbers C = {a+ib
More informationUnconstrained minimization of smooth functions
Unconstrained minimization of smooth functions We want to solve min x R N f(x), where f is convex. In this section, we will assume that f is differentiable (so its gradient exists at every point), and
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 3 Lecture 3 3.1 General remarks March 4, 2018 This
More informationThe Newton Bracketing method for the minimization of convex functions subject to affine constraints
Discrete Applied Mathematics 156 (2008) 1977 1987 www.elsevier.com/locate/dam The Newton Bracketing method for the minimization of convex functions subject to affine constraints Adi Ben-Israel a, Yuri
More informationNotions of. Antonio Mucherino. last update: August University of Rennes 1 Numerical Analysis. A.
Notions of Antonio Mucherino University of Rennes 1 www.antoniomucherino.it... last update: August 2013 commom s ... commom s Aircraft and wind Suppose an aircraft flies from Paris to Rio and then it comes
More informationMath 12 Final Exam Review 1
Math 12 Final Exam Review 1 Part One Calculators are NOT PERMITTED for this part of the exam. 1. a) The sine of angle θ is 1 What are the 2 possible values of θ in the domain 0 θ 2π? 2 b) Draw these angles
More informationMathematics for Business and Economics - I. Chapter 5. Functions (Lecture 9)
Mathematics for Business and Economics - I Chapter 5. Functions (Lecture 9) Functions The idea of a function is this: a correspondence between two sets D and R such that to each element of the first set,
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More informationLock-Free Approaches to Parallelizing Stochastic Gradient Descent
Lock-Free Approaches to Parallelizing Stochastic Gradient Descent Benjamin Recht Department of Computer Sciences University of Wisconsin-Madison with Feng iu Christopher Ré Stephen Wright minimize x f(x)
More informationSome Observations on Exclusion Regions in Branch and Bound Algorithms
Noname manuscript No. (will be inserted by the editor) Some Observations on Exclusion Regions in Branch and Bound Algorithms Ralph Baker Kearfott Received: date / Accepted: date Abstract In branch and
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationFast evaluation of mixed derivatives and calculation of optimal weights for integration. Hernan Leovey
Fast evaluation of mixed derivatives and calculation of optimal weights for integration Humboldt Universität zu Berlin 02.14.2012 MCQMC2012 Tenth International Conference on Monte Carlo and Quasi Monte
More information0, otherwise. Find each of the following limits, or explain that the limit does not exist.
Midterm Solutions 1, y x 4 1. Let f(x, y) = 1, y 0 0, otherwise. Find each of the following limits, or explain that the limit does not exist. (a) (b) (c) lim f(x, y) (x,y) (0,1) lim f(x, y) (x,y) (2,3)
More informationSome Observations on Exclusion Regions in Branch and Bound Algorithms
Noname manuscript No. (will be inserted by the editor) Some Observations on Exclusion Regions in Branch and Bound Algorithms Ralph Baker Kearfott Received: date / Accepted: date Abstract In branch and
More informationMTH30 Review Sheet. y = g(x) BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE
BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS & COMPUTER SCIENCE MTH0 Review Sheet. Given the functions f and g described by the graphs below: y = f(x) y = g(x) (a)
More information1. Method 1: bisection. The bisection methods starts from two points a 0 and b 0 such that
Chapter 4 Nonlinear equations 4.1 Root finding Consider the problem of solving any nonlinear relation g(x) = h(x) in the real variable x. We rephrase this problem as one of finding the zero (root) of a
More informationNonlinear Symbolic Transformations for Simplifying Optimization Problems
Acta Cybernetica 00 (0000) 1 17. Nonlinear Symbolic Transformations for Simplifying Optimization Problems Elvira Antal and Tibor Csendes Abstract The theory of nonlinear optimization traditionally studies
More informationSHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
Math 170 Final Exam Review Name SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Evaluate the function at the given value of the independent variable and
More informationAn Introduction to Differential Algebra
An Introduction to Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al. 1 ESA Advanced Concepts Team (TEC-SF) SRL, Milan Dinamica Outline 1 Overview Five Views of Differential Algebra
More informationTable-Based Polynomials for Fast Hardware Function Evaluation
ASAP 05 Table-Based Polynomials for Fast Hardware Function Evaluation Jérémie Detrey Florent de Dinechin Projet Arénaire LIP UMR CNRS ENS Lyon UCB Lyon INRIA 5668 http://www.ens-lyon.fr/lip/arenaire/ CENTRE
More informationA first order divided difference
A first order divided difference For a given function f (x) and two distinct points x 0 and x 1, define f [x 0, x 1 ] = f (x 1) f (x 0 ) x 1 x 0 This is called the first order divided difference of f (x).
More informationCalculus. Weijiu Liu. Department of Mathematics University of Central Arkansas 201 Donaghey Avenue, Conway, AR 72035, USA
Calculus Weijiu Liu Department of Mathematics University of Central Arkansas 201 Donaghey Avenue, Conway, AR 72035, USA 1 Opening Welcome to your Calculus I class! My name is Weijiu Liu. I will guide you
More informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationDiscussion and Empirical Comparisons of Linear Relaxations and Alternate Techniques in Validated Deterministic Global Optimization
Discussion and Empirical Comparisons of Linear Relaxations and Alternate Techniques in Validated Deterministic Global Optimization R. Baker Kearfott April 27, 2004 Abstract Both theory and implementations
More informationA Branch-and-Refine Method for Nonconvex Mixed-Integer Optimization
A Branch-and-Refine Method for Nonconvex Mixed-Integer Optimization Sven Leyffer 2 Annick Sartenaer 1 Emilie Wanufelle 1 1 University of Namur, Belgium 2 Argonne National Laboratory, USA IMA Workshop,
More informationSolutions to problems. The function f(x) is constant when 2 cos θ 1 = 0, or when θ = π/3, and its constant value in this case is 3/4.
103 Determine a value of the parameter θ so that is a constant function of x Solution 1 Solutions to problems f(x) cos x + cos (x + θ) cos x cos(x + θ) f(x) = cos x + (cos x cos θ sin x sin θ) cos x(cos
More informationSHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
Math 170 Final Exam Review Name SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Evaluate the function at the given value of the independent variable and
More information