Solutions to 8 th Order Polynomial Minimization Problem

Size: px
Start display at page:

Download "Solutions to 8 th Order Polynomial Minimization Problem"

Transcription

1 Solutions to 8 th Order Polynomial Minimization Problem Timothy K. Gao timkgao@gmail.com Blacksburg High School VA 26 USA Abstract This paper presents a special canonical dual transformation method for finding global minimizer of a class of 8 th order polynomials. The method can be used to solve the 7 th order nonlinear algebraic equations that are their derivatives. Applications are illustrated by examples. Primal Problem and its Canonical Dual This paper presents a method to find global minimizer of the following 8 th order polynomial minimization problem where P 8 (x) = 2 a 2(y 2 (x)) 2 + b 2 y 2 (x) + c 2 dx, () y 2 (x) = 2 (y (x)) 2 + b y (x) + c, y (x) = 2 a x 2 + b x + c, (2) where a i, b i, c i (i =,, 2), and d are given constants. In this paper, we assume that a i (i =,, 2). The criticality condition of P 8 (x) leads to a 7 th order nonlinear algebraic equation (a 2 y 2 (x) + b 2 )( y (x) + b )(a x + b ) d =. (3) Clearly, direct methods for solving this 7 th order nonlinear algebraic equation are very difficult, or even impossible. Also, identifying the global minimizer of P 8 (x) is a fundamentally difficult task in global optimization. The canonical duality theory developed in [] is a potentially useful methodology, and can be used to solve a relatively large class of nonlinear algebraic and differential equations. The associated triality theory can be used to identify both global minimizer and local extrema. In the recent paper [2], a special polynomial P n (x) with b i = (i =,, 2,, n) has been studied. The purpose of this paper is to generalize this result to solve the 7 th order nonlinear equation and to identify global minimizer of P 8 (x). The main result of this paper was announced at the 7 Virginia State Science and Engineering Fair and received an award. 27

2 2 Canonical Dual Polynomial From the pattern of the 8 th order polynomial defined in (), we can let y 2 (x) = U (y (x)) = P 4 (x) = 2 (y (x)) 2 + b y (x) + c, (4) which is a quadratic function of y. The dual variable s of y is defined as By solving this duality relation, we have Thus, by using the Legendre transformation the Legendre conjugate function U (s ) is well-defined as In the same way, U 2 is set equal to s = U (y ) = y + b. (5) y (s ) = s b. (6) U (s ) = y (s )s U (y (s )), (7) U (s ) = c b (s b ) + s (s b ) (s b ) 2 = (s b ) 2 c. (8) The duality relation between y 2 and s 2 is Then, the Legendre conjugate of U 2 (y 2 ) is By the fact that the polynomial () can be written as U 2 (y 2 (x)) = 2 a 2(y 2 (x)) 2 + b 2 y 2 (x) + c 2. (9) s 2 = U 2(y 2 ) = a 2 y 2 + b 2. () U 2 (s 2 ) = c 2 b 2(s 2 b 2 ) a 2 + s 2(s 2 b 2 ) a 2 (s 2 b 2 ) 2 2a 2 = (s 2 b 2 ) 2 2a 2 c 2. () U 2 (y 2 ) + U 2 (s 2 ) = y 2 s 2, (2) P 8 (x) = U 2 (x) + c 2 dx = y 2 (x)s 2 U 2 (s 2 ) + c 2 dx. (3) 272

3 Manipulation of equations (4) and (7) gives Therefore, y 2 = U = y s U (s ). (4) P 8 (x) = s 2 (y (x)s U ) U 2 + c 2 dx. (5) Let Ξ(x, s, s 2 ) equal to equation (5). Further simplification yields By solving Ξ/ x we have Ξ(x, s, s 2 ) = s 2 [( 2 a x 2 + b x + c )s U (s )] U 2 (s 2 ) + c 2 dx. (6) x(s, s 2 ) = d a s s 2 b a. (7) Substituting this x into (6) and setting the final equation equal to P d (s, s 2 ), the canonical dual function can be obtained as P d (s, s 2 ) = Ξ(x(s, s 2 ), s, s 2 ) [ = s s 2 c ( ] d s s 2 b ) 2 s 2 U (s ) U2 (s 2 ) + c 2. (8) 2a By combining (4), (6) and () and simplifying, the relation between s and s 2 is given by ( ( ) ) 2 s 2 = a 2 2 a s b s b + b + c + b 2 ( ) s 2 = b c + b 2. (9) By substituting (9) into (8) and letting s = s, the canonical dual function is finally obtained as P d (s) = P d (s, s 2 (s)). By using Mathematica, P d (s) can be calculated as P d (s) = c 2 a ( 2(s 2 + c b 2 ) 2 + b 8a a 2 c + a ) 2(s 2 b 2 ) 2a [ c (s b ( ) )] ) s (c (2a ) d b () s( b 2 + a 2 (s 2 + c b 2 )) From the canonical duality theory [], we have the following result: Theorem If s is a critical point of P d (s), then with x(s) = d a s 2 s b a, (2) s 2 = a 2 ( s2 b 2 + c ) + b 2 (22) is a critical point of P (x) and P (x) = P d (s). Moreover, if s is the largest critical point, then x(s) is a global minimizer of P (x). 273

4 3 Applications 3. Example Let a =.; =.5; a 2 =.5; b = ; b = ; b 2 = ; c = 6; c = ; c 2 =.5; d =.5, we have P 8 (x) =.5.5x ( 6 +.5x 2 ) 4. (23) This is a nonconvex polynomial of degree eight with one global minimizer, one local minimizer and one local maximizer as shown in Fig Figure. Nonconvex P 8 (x) with one global minimizer, one local minimizer and one local maximizer. The canonical dual of this P 8 (x) has a very simple form Its graph is shown in Fig. 2. P d (s) = ( s 6 )s s 4. (24) Figure 2. Canonical dual polynomial P d (s). The criticality condition P d (s) = has three real roots s = > s 2 =.597 > s 3 = (25) From equation (2), we have x = 3.54, x 2 = , and x 3 =.99. It is easy to check that P (x ) = = P d (s ) < P (x 2 ) = = P d (s 2 ) < P (x 3 ) = = P d (s 3 ). (26) 274

5 This shows that x is a global minimizer, x 2 is a local minimizer, and x 3 is a local maximizer (see Fig. 3) Figure 3. Canonical dual polynomialp d (s). 3.2 Example 2 In Example, if we let a =.; =.5; a 2 =.5; b =.; b =.2; b 2 = ; c = 7.5; c = 5; c 2 =.5; d =.5, the graph of the polynomial P 8 (x) is shown in Fig Figure 4. Nonconvex P 8 (x) with c = 7.5. In this case, the canonical dual function P d (s) has a total of seven critical points (see Fig. 5) Figure 5. Canonical dual polynomialp d (s). s 7 = < s 6 = < s 5 = < s 4 = < s 3 =.4673 < s 2 = < s =

6 By the Theorem we know that x = is a global minimizer of P (x) and P (x ) = P d (s ) = (see Fig. 6) Figure 6. Graphs of P (x) and P d (s). 4 Conclusions The results of this paper can be used to find the all critical points of the eighth polynomial derivative of equation (). One advantage of using this way to find the critical values of P 8 is that, when the derivative of P d (s) is set to and the critical values of P d (s) are found, the critical value with the largest value of s is the absolute minimum. Supplementary File A Mathematica file is available for those who wish to experiment with these techniques. Acknowledgements Special thanks go to David Gao, who showed how to use the method on 4 th degree polynomials of the form P 4 = 2 (y ) 2 + b y + c. The author also would like to offer his sincere thanks to Dr. Ning Ruan for suggestive discuss and detailed comments, which improved this paper dramatically. This research project was under supervision of Mr. Michael Collver at Blacksburg High School. References [] Gao, D.Y.(). Duality Principles in Nonconvex Systems: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht/Boston/London, xviii+454pp. [2] Gao, D.Y. (6). Complete solutions to a class of polynomial minimization problems, J. Global Optimization, 35,

SOLUTIONS AND OPTIMALITY CRITERIA TO BOX CONSTRAINED NONCONVEX MINIMIZATION PROBLEMS. David Yang Gao. (Communicated by K.L. Teo)

SOLUTIONS AND OPTIMALITY CRITERIA TO BOX CONSTRAINED NONCONVEX MINIMIZATION PROBLEMS. David Yang Gao. (Communicated by K.L. Teo) JOURNAL OF INDUSTRIAL AND Website: http://aimsciences.org MANAGEMENT OPTIMIZATION Volume 3, Number 2, May 2007 pp. 293 304 SOLUTIONS AND OPTIMALITY CRITERIA TO BOX CONSTRAINED NONCONVEX MINIMIZATION PROBLEMS

More information

Journal of Computational and Applied Mathematics

Journal of Computational and Applied Mathematics Journal of Computational and Applied Mathematics 234 (2) 538 544 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam

More information

CANONICAL DUAL APPROACH TO SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS. Shu-Cherng Fang. David Yang Gao. Ruey-Lin Sheu. Soon-Yi Wu

CANONICAL DUAL APPROACH TO SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS. Shu-Cherng Fang. David Yang Gao. Ruey-Lin Sheu. Soon-Yi Wu JOURNAL OF INDUSTRIAL AND Website: http://aimsciences.org MANAGEMENT OPTIMIZATION Volume 4, Number 1, February 2008 pp. 125 142 CANONICAL DUAL APPROACH TO SOLVING 0-1 QUADRATIC PROGRAMMING PROBLEMS Shu-Cherng

More information

6x 2 8x + 5 ) = 12x 8. f (x) ) = d (12x 8) = 12

6x 2 8x + 5 ) = 12x 8. f (x) ) = d (12x 8) = 12 AMS/ECON 11A Class Notes 11/6/17 UCSC *) Higher order derivatives Example. If f = x 3 x + 5x + 1, then f = 6x 8x + 5 Observation: f is also a differentiable function... d f ) = d 6x 8x + 5 ) = 1x 8 dx

More information

arxiv: v1 [math.oc] 16 Jul 2016

arxiv: v1 [math.oc] 16 Jul 2016 Canonical dual method for mixed integer fourth-order polynomial minimization problems with fixed cost terms Zhong Jin David Y Gao arxiv:607.04748v [math.oc] 6 Jul 06 Abstract we study a canonical duality

More information

Section 4.1: Polynomial Functions and Models

Section 4.1: Polynomial Functions and Models Section 4.1: Polynomial Functions and Models Learning Objectives: 1. Identify Polynomial Functions and Their Degree 2. Graph Polynomial Functions Using Transformations 3. Identify the Real Zeros of a Polynomial

More information

Research Article Complete Solutions to General Box-Constrained Global Optimization Problems

Research Article Complete Solutions to General Box-Constrained Global Optimization Problems Journal of Applied Mathematics Volume, Article ID 47868, 7 pages doi:.55//47868 Research Article Complete Solutions to General Box-Constrained Global Optimization Problems Dan Wu and Youlin Shang Department

More information

arxiv: v2 [math-ph] 26 Nov 2014

arxiv: v2 [math-ph] 26 Nov 2014 1 Mathematics and Mechanics of Solids Canonical Duality-Triality Theory: Bridge Between Nonconvex Analysis/Mechanics and Global Optimization in Complex Systems arxiv:1410.2665v2 [math-ph] 26 Nov 2014 David

More information

7. Response Surface Methodology (Ch.10. Regression Modeling Ch. 11. Response Surface Methodology)

7. Response Surface Methodology (Ch.10. Regression Modeling Ch. 11. Response Surface Methodology) 7. Response Surface Methodology (Ch.10. Regression Modeling Ch. 11. Response Surface Methodology) Hae-Jin Choi School of Mechanical Engineering, Chung-Ang University 1 Introduction Response surface methodology,

More information

Analytical Solutions to General Anti-Plane Shear Problems In Finite Elasticity

Analytical Solutions to General Anti-Plane Shear Problems In Finite Elasticity Analytical Solutions to General Anti-Plane Shear Problems In Finite Elasticity David Yang Gao Federation University Australia, Mt Helen, VIC 3353, Australia Research School of Engineering, Australian National

More information

Chapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64

Chapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64 Chapter 7 Polynomial Functions Factoring Review We will talk about 3 Types: 1. 2. 3. ALWAYS FACTOR OUT FIRST! Ex 1: Factor x 2 + 5x + 6 Ex 2: Factor x 2 + 16x + 64 Ex 3: Factor 4x 2 + 6x 18 Ex 4: Factor

More information

A Numerical Investigation Of The Canonical Duality Method For Non-Convex Variational Problems

A Numerical Investigation Of The Canonical Duality Method For Non-Convex Variational Problems A Numerical Investigation Of The Canonical Duality Method For Non-Convex Variational Problems Haofeng Yu Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University

More information

H-Pre-Calculus Targets Chapter I can write quadratic functions in standard form and use the results to sketch graphs of the function.

H-Pre-Calculus Targets Chapter I can write quadratic functions in standard form and use the results to sketch graphs of the function. H-Pre-Calculus Targets Chapter Section. Sketch and analyze graphs of quadratic functions.. I can write quadratic functions in standard form and use the results to sketch graphs of the function. Identify

More information

Polynomial functions right- and left-hand behavior (end behavior):

Polynomial functions right- and left-hand behavior (end behavior): Lesson 2.2 Polynomial Functions For each function: a.) Graph the function on your calculator Find an appropriate window. Draw a sketch of the graph on your paper and indicate your window. b.) Identify

More information

Lecture 5. The Dual Cone and Dual Problem

Lecture 5. The Dual Cone and Dual Problem IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the

More information

Pre-Calculus: Functions and Their Properties (Solving equations algebraically and graphically, matching graphs, tables, and equations, and

Pre-Calculus: Functions and Their Properties (Solving equations algebraically and graphically, matching graphs, tables, and equations, and Pre-Calculus: 1.1 1.2 Functions and Their Properties (Solving equations algebraically and graphically, matching graphs, tables, and equations, and finding the domain, range, VA, HA, etc.). Name: Date:

More information

arxiv: v1 [math.oc] 14 Jul 2016

arxiv: v1 [math.oc] 14 Jul 2016 ON THE EXTREMA OF A NONCONVEX FUNCTIONAL WITH DOUBLE-WELL POTENTIAL IN HIGHER DIMENSIONS XIAOJUN LU 1 DAVID YANG GAO 2 arxiv:1607.03995v1 [math.oc] 14 Jul 2016 1. Department of Mathematics & Jiangsu Key

More information

Pre-Calculus Midterm Practice Test (Units 1 through 3)

Pre-Calculus Midterm Practice Test (Units 1 through 3) Name: Date: Period: Pre-Calculus Midterm Practice Test (Units 1 through 3) Learning Target 1A I can describe a set of numbers in a variety of ways. 1. Write the following inequalities in interval notation.

More information

6x 2 8x + 5 ) = 12x 8

6x 2 8x + 5 ) = 12x 8 Example. If f(x) = x 3 4x + 5x + 1, then f (x) = 6x 8x + 5 Observation: f (x) is also a differentiable function... d dx ( f (x) ) = d dx ( 6x 8x + 5 ) = 1x 8 The derivative of f (x) is called the second

More information

A DUALITY THEOREM FOR NON-LINEAR PROGRAMMING* PHILIP WOLFE. The RAND Corporation

A DUALITY THEOREM FOR NON-LINEAR PROGRAMMING* PHILIP WOLFE. The RAND Corporation 239 A DUALITY THEOREM FOR N-LINEAR PROGRAMMING* BY PHILIP WOLFE The RAND Corporation Summary. A dual problem is formulated for the mathematical programming problem of minimizing a convex function under

More information

BBM402-Lecture 20: LP Duality

BBM402-Lecture 20: LP Duality BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to

More information

1 Number Systems and Errors 1

1 Number Systems and Errors 1 Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........

More information

m i=1 c ix i i=1 F ix i F 0, X O.

m i=1 c ix i i=1 F ix i F 0, X O. What is SDP? for a beginner of SDP Copyright C 2005 SDPA Project 1 Introduction This note is a short course for SemiDefinite Programming s SDP beginners. SDP has various applications in, for example, control

More information

A. Incorrect! Apply the rational root test to determine if any rational roots exist.

A. Incorrect! Apply the rational root test to determine if any rational roots exist. College Algebra - Problem Drill 13: Zeros of Polynomial Functions No. 1 of 10 1. Determine which statement is true given f() = 3 + 4. A. f() is irreducible. B. f() has no real roots. C. There is a root

More information

Higher-Degree Polynomial Functions. Polynomials. Polynomials

Higher-Degree Polynomial Functions. Polynomials. Polynomials Higher-Degree Polynomial Functions 1 Polynomials A polynomial is an expression that is constructed from one or more variables and constants, using only the operations of addition, subtraction, multiplication,

More information

Kernel methods, kernel SVM and ridge regression

Kernel methods, kernel SVM and ridge regression Kernel methods, kernel SVM and ridge regression Le Song Machine Learning II: Advanced Topics CSE 8803ML, Spring 2012 Collaborative Filtering 2 Collaborative Filtering R: rating matrix; U: user factor;

More information

Algebra I Assessment. Eligible Texas Essential Knowledge and Skills

Algebra I Assessment. Eligible Texas Essential Knowledge and Skills Algebra I Assessment Eligible Texas Essential Knowledge and Skills STAAR Algebra I Assessment Reporting Category 1: Functional Relationships The student will describe functional relationships in a variety

More information

CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III. Instructor: Shaddin Dughmi

CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III. Instructor: Shaddin Dughmi CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 17: Combinatorial Problems as Linear Programs III Instructor: Shaddin Dughmi Announcements Today: Spanning Trees and Flows Flexibility awarded

More information

Tennessee Department of Education

Tennessee Department of Education Tennessee Department of Education Task: Fourth Degree Polynomial Algebra II Pre Problem Work: Create up with a second degree polynomial that has an x 2 and a constant term, but not an x term, and that

More information

Part 1. The Review of Linear Programming

Part 1. The Review of Linear Programming In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation

More information

8.1 Polynomial Functions

8.1 Polynomial Functions 8.1 Polynomial Functions Algebra Goal 1: Evaluate polynomial functions. Goal : Identify general shapes of the graphs of polynomial functions. 1. What is a polynomial in one variable? Example 1: Determine

More information

Lecture 10: A brief introduction to Support Vector Machine

Lecture 10: A brief introduction to Support Vector Machine Lecture 10: A brief introduction to Support Vector Machine Advanced Applied Multivariate Analysis STAT 2221, Fall 2013 Sungkyu Jung Department of Statistics, University of Pittsburgh Xingye Qiao Department

More information

Get acquainted with the computer program, The Quadratic Transformer. When you're satisfied that you understand how it works, try the tasks below.

Get acquainted with the computer program, The Quadratic Transformer. When you're satisfied that you understand how it works, try the tasks below. Weaving a Parabola Web with the Quadratic Transformer In this activity, you explore how the graph of a quadratic function and its symbolic expression relate to each other. You start with a set of four

More information

Performing well in calculus is impossible without a solid algebra foundation. Many calculus

Performing well in calculus is impossible without a solid algebra foundation. Many calculus Chapter Algebra Review Performing well in calculus is impossible without a solid algebra foundation. Many calculus problems that you encounter involve a calculus concept but then require many, many steps

More information

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam

Jim Lambers MAT 460/560 Fall Semester Practice Final Exam Jim Lambers MAT 460/560 Fall Semester 2009-10 Practice Final Exam 1. Let f(x) = sin 2x + cos 2x. (a) Write down the 2nd Taylor polynomial P 2 (x) of f(x) centered around x 0 = 0. (b) Write down the corresponding

More information

Mathematical Preliminaries

Mathematical Preliminaries Chapter 33 Mathematical Preliminaries In this appendix, we provide essential definitions and key results which are used at various points in the book. We also provide a list of sources where more details

More information

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE STORY SO FAR THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS USES OF THE PYTHAGOREAN THEOREM SOLVE RIGHT TRIANGLE APPLICATIONS

More information

Introduction to Applied Linear Algebra with MATLAB

Introduction to Applied Linear Algebra with MATLAB Sigam Series in Applied Mathematics Volume 7 Rizwan Butt Introduction to Applied Linear Algebra with MATLAB Heldermann Verlag Contents Number Systems and Errors 1 1.1 Introduction 1 1.2 Number Representation

More information

Jeff Howbert Introduction to Machine Learning Winter

Jeff Howbert Introduction to Machine Learning Winter Classification / Regression Support Vector Machines Jeff Howbert Introduction to Machine Learning Winter 2012 1 Topics SVM classifiers for linearly separable classes SVM classifiers for non-linearly separable

More information

SF2822 Applied nonlinear optimization, final exam Saturday December

SF2822 Applied nonlinear optimization, final exam Saturday December SF2822 Applied nonlinear optimization, final exam Saturday December 20 2008 8.00 13.00 Examiner: Anders Forsgren, tel. 790 71 27. Allowed tools: Pen/pencil, ruler and eraser; plus a calculator provided

More information

Algebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions

Algebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions Algebra III Chapter 2 Note Packet Name Essential Question: Section 2.1: Polynomial Functions Polynomials -Have nonnegative exponents -Variables ONLY in -General Form n ax + a x +... + ax + ax+ a n n 1

More information

CURRICULUM CATALOG. Algebra II (3135) VA

CURRICULUM CATALOG. Algebra II (3135) VA 2018-19 CURRICULUM CATALOG Algebra II (3135) VA Table of Contents COURSE OVERVIEW... 1 UNIT 1: STRUCTURE AND FUNCTIONS... 1 UNIT 2: LINEAR FUNCTIONS... 2 UNIT 3: INEQUALITIES AND ABSOLUTE VALUE... 2 UNIT

More information

SOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi

SOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM

More information

Unit 4 Polynomial/Rational Functions Zeros of Polynomial Functions (Unit 4.3)

Unit 4 Polynomial/Rational Functions Zeros of Polynomial Functions (Unit 4.3) Unit 4 Polynomial/Rational Functions Zeros of Polynomial Functions (Unit 4.3) William (Bill) Finch Mathematics Department Denton High School Lesson Goals When you have completed this lesson you will: Find

More information

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3 MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications

More information

Lecture #21. c T x Ax b. maximize subject to

Lecture #21. c T x Ax b. maximize subject to COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the

More information

Mathematics Online Instructional Materials Correlation to the 2009 Algebra II Standards of Learning and Curriculum Framework

Mathematics Online Instructional Materials Correlation to the 2009 Algebra II Standards of Learning and Curriculum Framework and Curriculum Framework Provider York County School Division Course Title Algebra II AB Last Updated 2010-11 Course Syllabus URL http://yorkcountyschools.org/virtuallearning/coursecatalog.aspx AII.1 The

More information

Indirect Rule Learning: Support Vector Machines. Donglin Zeng, Department of Biostatistics, University of North Carolina

Indirect Rule Learning: Support Vector Machines. Donglin Zeng, Department of Biostatistics, University of North Carolina Indirect Rule Learning: Support Vector Machines Indirect learning: loss optimization It doesn t estimate the prediction rule f (x) directly, since most loss functions do not have explicit optimizers. Indirection

More information

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach

More information

PAP Geometry Summer Work- Show your work

PAP Geometry Summer Work- Show your work PRE- PAP Geometry Summer Work- Show your work Solve the equation. Check your solution. 1. 2. Solve the equation. 3. 4. 5. Describe the values of c for which the equation has no solution. Write the sentence

More information

Chapter 2 Polynomial and Rational Functions

Chapter 2 Polynomial and Rational Functions Chapter 2 Polynomial and Rational Functions Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Quadratic Functions Polynomial Functions of Higher Degree Real Zeros of Polynomial Functions

More information

Graphing Rational Functions

Graphing Rational Functions Unit 1 R a t i o n a l F u n c t i o n s Graphing Rational Functions Objectives: 1. Graph a rational function given an equation 2. State the domain, asymptotes, and any intercepts Why? The function describes

More information

CHAPTER 2: Polynomial and Rational Functions

CHAPTER 2: Polynomial and Rational Functions (Exercises for Chapter 2: Polynomial and Rational Functions) E.2.1 CHAPTER 2: Polynomial and Rational Functions (A) means refer to Part A, (B) means refer to Part B, etc. (Calculator) means use a calculator.

More information

HOMEWORK 7 SOLUTIONS

HOMEWORK 7 SOLUTIONS HOMEWORK 7 SOLUTIONS MA11: ADVANCED CALCULUS, HILARY 17 (1) Using the method of Lagrange multipliers, find the largest and smallest values of the function f(x, y) xy on the ellipse x + y 1. Solution: The

More information

Support Vector Machines: Maximum Margin Classifiers

Support Vector Machines: Maximum Margin Classifiers Support Vector Machines: Maximum Margin Classifiers Machine Learning and Pattern Recognition: September 16, 2008 Piotr Mirowski Based on slides by Sumit Chopra and Fu-Jie Huang 1 Outline What is behind

More information

SVMs, Duality and the Kernel Trick

SVMs, Duality and the Kernel Trick SVMs, Duality and the Kernel Trick Machine Learning 10701/15781 Carlos Guestrin Carnegie Mellon University February 26 th, 2007 2005-2007 Carlos Guestrin 1 SVMs reminder 2005-2007 Carlos Guestrin 2 Today

More information

Optimality, Duality, Complementarity for Constrained Optimization

Optimality, Duality, Complementarity for Constrained Optimization Optimality, Duality, Complementarity for Constrained Optimization Stephen Wright University of Wisconsin-Madison May 2014 Wright (UW-Madison) Optimality, Duality, Complementarity May 2014 1 / 41 Linear

More information

The first two give solutions x = 0 (multiplicity 2), and x = 3. The third requires the quadratic formula:

The first two give solutions x = 0 (multiplicity 2), and x = 3. The third requires the quadratic formula: Precalculus:.4 Miscellaneous Equations Concepts: Factoring Higher Degree Equations, Equations Involving Square Roots, Equations with Rational Exponents, Equations of Quadratic Type, Equations Involving

More information

HMH Fuse Algebra correlated to the. Texas Essential Knowledge and Skills for Mathematics High School Algebra 1

HMH Fuse Algebra correlated to the. Texas Essential Knowledge and Skills for Mathematics High School Algebra 1 HMH Fuse Algebra 1 2012 correlated to the Texas Essential Knowledge and Skills for Mathematics High School Algebra 1 111.32. Algebra I (b) Knowledge and skills. (1) Foundations for functions. The student

More information

Calculus II. Monday, March 13th. WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20

Calculus II. Monday, March 13th. WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20 Announcements Calculus II Monday, March 13th WebAssign 7 due Friday March 17 Problem Set 6 due Wednesday March 15 Midterm 2 is Monday March 20 Today: Sec. 8.5: Partial Fractions Use partial fractions to

More information

Duality Methods in Portfolio Allocation with Transaction Constraints and Uncertainty

Duality Methods in Portfolio Allocation with Transaction Constraints and Uncertainty Duality Methods in Portfolio Allocation with Transaction Constraints and Uncertainty Christopher W. Miller Department of Mathematics University of California, Berkeley January 9, 2014 Project Overview

More information

SF2822 Applied nonlinear optimization, final exam Wednesday June

SF2822 Applied nonlinear optimization, final exam Wednesday June SF2822 Applied nonlinear optimization, final exam Wednesday June 3 205 4.00 9.00 Examiner: Anders Forsgren, tel. 08-790 7 27. Allowed tools: Pen/pencil, ruler and eraser. Note! Calculator is not allowed.

More information

CONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley

CONVEX ALGEBRAIC GEOMETRY. Bernd Sturmfels UC Berkeley CONVEX ALGEBRAIC GEOMETRY Bernd Sturmfels UC Berkeley Multifocal Ellipses Given m points (u 1, v 1 ),...,(u m, v m )intheplaner 2,and aradiusd > 0, their m-ellipse is the convex algebraic curve { (x, y)

More information

Kernel Methods. Barnabás Póczos

Kernel Methods. Barnabás Póczos Kernel Methods Barnabás Póczos Outline Quick Introduction Feature space Perceptron in the feature space Kernels Mercer s theorem Finite domain Arbitrary domain Kernel families Constructing new kernels

More information

Machine Learning : Support Vector Machines

Machine Learning : Support Vector Machines Machine Learning Support Vector Machines 05/01/2014 Machine Learning : Support Vector Machines Linear Classifiers (recap) A building block for almost all a mapping, a partitioning of the input space into

More information

Lecture Note 5: Semidefinite Programming for Stability Analysis

Lecture Note 5: Semidefinite Programming for Stability Analysis ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State

More information

Pre-Calculus EOC Review 2016

Pre-Calculus EOC Review 2016 Pre-Calculus EOC Review 2016 Name The Exam 50 questions, multiple choice, paper and pencil. I. Limits 8 questions a. (1) decide if a function is continuous at a point b. (1) understand continuity in terms

More information

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs

Introduction to Mathematical Programming IE406. Lecture 10. Dr. Ted Ralphs Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3 IE406 Lecture 10 2 Duality Theory: Motivation Consider the following

More information

Section 3.6 Complex Zeros

Section 3.6 Complex Zeros 04 Chapter Section 6 Complex Zeros When finding the zeros of polynomials, at some point you're faced with the problem x = While there are clearly no real numbers that are solutions to this equation, leaving

More information

Sec 3 Express E-Math & A-Math Syllabus (For Class 301 to 305)

Sec 3 Express E-Math & A-Math Syllabus (For Class 301 to 305) Sec 3 Express E-Math & A-Math Syllabus (For Class 301 to 305) Chapter 1 (EM) Quadratic Equations and Chapter 4 (EM) Coordinate Geometry Chapter 6 (EM) Further Trigonometry Chapter 2 (EM) Linear Inequalities

More information

16.1 L.P. Duality Applied to the Minimax Theorem

16.1 L.P. Duality Applied to the Minimax Theorem CS787: Advanced Algorithms Scribe: David Malec and Xiaoyong Chai Lecturer: Shuchi Chawla Topic: Minimax Theorem and Semi-Definite Programming Date: October 22 2007 In this lecture, we first conclude our

More information

Georgia Department of Education Common Core Georgia Performance Standards Framework CCGPS Advanced Algebra Unit 2

Georgia Department of Education Common Core Georgia Performance Standards Framework CCGPS Advanced Algebra Unit 2 Polynomials Patterns Task 1. To get an idea of what polynomial functions look like, we can graph the first through fifth degree polynomials with leading coefficients of 1. For each polynomial function,

More information

All rights reserved. Reproduction of these materials for instructional purposes in public school classrooms in Virginia is permitted.

All rights reserved. Reproduction of these materials for instructional purposes in public school classrooms in Virginia is permitted. Algebra I Copyright 2009 by the Virginia Department of Education P.O. Box 2120 Richmond, Virginia 23218-2120 http://www.doe.virginia.gov All rights reserved. Reproduction of these materials for instructional

More information

5. Polynomial Functions and Equations

5. Polynomial Functions and Equations 5. Polynomial Functions and Equations 1. Polynomial equations and roots. Solving polynomial equations in the chemical context 3. Solving equations of multiple unknowns 5.1. Polynomial equations and roots

More information

Nonlinear Optimization: What s important?

Nonlinear Optimization: What s important? Nonlinear Optimization: What s important? Julian Hall 10th May 2012 Convexity: convex problems A local minimizer is a global minimizer A solution of f (x) = 0 (stationary point) is a minimizer A global

More information

All rights reserved. Reproduction of these materials for instructional purposes in public school classrooms in Virginia is permitted.

All rights reserved. Reproduction of these materials for instructional purposes in public school classrooms in Virginia is permitted. Algebra II Copyright 2009 by the Virginia Department of Education P.O. Box 2120 Richmond, Virginia 23218-2120 http://www.doe.virginia.gov All rights reserved. Reproduction of these materials for instructional

More information

Support Vector Machine (continued)

Support Vector Machine (continued) Support Vector Machine continued) Overlapping class distribution: In practice the class-conditional distributions may overlap, so that the training data points are no longer linearly separable. We need

More information

Check boxes of Edited Copy of Sp Topics (was 217-pilot)

Check boxes of Edited Copy of Sp Topics (was 217-pilot) Check boxes of Edited Copy of 10024 Sp 11 213 Topics (was 217-pilot) College Algebra, 9th Ed. [open all close all] R-Basic Algebra Operations Section R.1 Integers and rational numbers Rational and irrational

More information

Neural Networks. Prof. Dr. Rudolf Kruse. Computational Intelligence Group Faculty for Computer Science

Neural Networks. Prof. Dr. Rudolf Kruse. Computational Intelligence Group Faculty for Computer Science Neural Networks Prof. Dr. Rudolf Kruse Computational Intelligence Group Faculty for Computer Science kruse@iws.cs.uni-magdeburg.de Rudolf Kruse Neural Networks 1 Supervised Learning / Support Vector Machines

More information

Homework 1. 3x 12, 61.P (x) = 3t 21 Section 1.2

Homework 1. 3x 12, 61.P (x) = 3t 21 Section 1.2 Section 1.1 Homework 1 (34, 36) Determine whether the equation defines y as a function of x. 34. x + h 2 = 1, 36. y = 3x 1 x + 2. (40, 44) Find the following for each function: (a) f(0) (b) f(1) (c) f(

More information

College Algebra. Basics to Theory of Equations. Chapter Goals and Assessment. John J. Schiller and Marie A. Wurster. Slide 1

College Algebra. Basics to Theory of Equations. Chapter Goals and Assessment. John J. Schiller and Marie A. Wurster. Slide 1 College Algebra Basics to Theory of Equations Chapter Goals and Assessment John J. Schiller and Marie A. Wurster Slide 1 Chapter R Review of Basic Algebra The goal of this chapter is to make the transition

More information

A quadratic expression is a mathematical expression that can be written in the form 2

A quadratic expression is a mathematical expression that can be written in the form 2 118 CHAPTER Algebra.6 FACTORING AND THE QUADRATIC EQUATION Textbook Reference Section 5. CLAST OBJECTIVES Factor a quadratic expression Find the roots of a quadratic equation A quadratic expression is

More information

Economic Foundations of Symmetric Programming

Economic Foundations of Symmetric Programming Economic Foundations of Symmetric Programming QUIRINO PARIS University of California, Davis B 374309 CAMBRIDGE UNIVERSITY PRESS Foreword by Michael R. Caputo Preface page xv xvii 1 Introduction 1 Duality,

More information

Solving Quadratic Equations by Formula

Solving Quadratic Equations by Formula Algebra Unit: 05 Lesson: 0 Complex Numbers All the quadratic equations solved to this point have had two real solutions or roots. In some cases, solutions involved a double root, but there were always

More information

Numerical Methods. Equations and Partial Fractions. Jaesung Lee

Numerical Methods. Equations and Partial Fractions. Jaesung Lee Numerical Methods Equations and Partial Fractions Jaesung Lee Solving linear equations Solving linear equations Introduction Many problems in engineering reduce to the solution of an equation or a set

More information

Fundamental Theorem of Algebra (NEW): A polynomial function of degree n > 0 has n complex zeros. Some of these zeros may be repeated.

Fundamental Theorem of Algebra (NEW): A polynomial function of degree n > 0 has n complex zeros. Some of these zeros may be repeated. .5 and.6 Comple Numbers, Comple Zeros and the Fundamental Theorem of Algebra Pre Calculus.5 COMPLEX NUMBERS 1. Understand that - 1 is an imaginary number denoted by the letter i.. Evaluate the square root

More information

Incorporating detractors into SVM classification

Incorporating detractors into SVM classification Incorporating detractors into SVM classification AGH University of Science and Technology 1 2 3 4 5 (SVM) SVM - are a set of supervised learning methods used for classification and regression SVM maximal

More information

Support Vector Machines

Support Vector Machines Two SVM tutorials linked in class website (please, read both): High-level presentation with applications (Hearst 1998) Detailed tutorial (Burges 1998) Support Vector Machines Machine Learning 10701/15781

More information

Determining the Intervals on Which a Function is Increasing or Decreasing From the Graph of f

Determining the Intervals on Which a Function is Increasing or Decreasing From the Graph of f Math 1314 Applications of the First Derivative Determining the Intervals on Which a Function is Increasing or Decreasing From the Graph of f Definition: A function is increasing on an interval (a, b) if,

More information

Simpler semidefinite programs for completely bounded norms

Simpler semidefinite programs for completely bounded norms CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE http://cjtcs.cs.uchicago.edu/ Simpler semidefinite programs for completely bounded norms John Watrous July, 203 Abstract: The completely bounded trace and

More information

SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS

SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS Journal of Applied Analysis Vol. 9, No. 2 (2003), pp. 261 273 SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS I. GINCHEV and V. I. IVANOV Received June 16, 2002 and, in revised form,

More information

Foundation of Intelligent Systems, Part I. SVM s & Kernel Methods

Foundation of Intelligent Systems, Part I. SVM s & Kernel Methods Foundation of Intelligent Systems, Part I SVM s & Kernel Methods mcuturi@i.kyoto-u.ac.jp FIS - 2013 1 Support Vector Machines The linearly-separable case FIS - 2013 2 A criterion to select a linear classifier:

More information

MATH The Derivative as a Function - Section 3.2. The derivative of f is the function. f x h f x. f x lim

MATH The Derivative as a Function - Section 3.2. The derivative of f is the function. f x h f x. f x lim MATH 90 - The Derivative as a Function - Section 3.2 The derivative of f is the function f x lim h 0 f x h f x h for all x for which the limit exists. The notation f x is read "f prime of x". Note that

More information

QUANTUM SCHUBERT POLYNOMIALS FOR THE G 2 FLAG MANIFOLD

QUANTUM SCHUBERT POLYNOMIALS FOR THE G 2 FLAG MANIFOLD QUANTUM SCHUBERT POLYNOMIALS FOR THE G 2 FLAG MANIFOLD RACHEL ELLIOTT, MARK E. LEWERS, AND LEONARDO C. MIHALCEA Abstract. We study some combinatorial objects related to the flag manifold X of Lie type

More information

Quadratic and Polynomial Inequalities in one variable have look like the example below.

Quadratic and Polynomial Inequalities in one variable have look like the example below. Section 8 4: Polynomial Inequalities in One Variable Quadratic and Polynomial Inequalities in one variable have look like the example below. x 2 5x 6 0 (x 2) (x + 4) > 0 x 2 (x 3) > 0 (x 2) 2 (x + 4) 0

More information

Semidefinite Programming

Semidefinite Programming Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i

More information

Quantile Textbook Report

Quantile Textbook Report Quantile Textbook Report Algebra 1 Author Charles, Randall I., et al StateEdition West Virginia Grade Algebra 1 1 Foundations for Algebra 1.1 Variables and Expressions 750Q 1.2 Order of Operations and

More information

ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS

ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental

More information

Analyzing Functions Maximum & Minimum Points Lesson 75

Analyzing Functions Maximum & Minimum Points Lesson 75 (A) Lesson Objectives a. Understand what is meant by the term extrema as it relates to functions b. Use graphic and algebraic methods to determine extrema of a function c. Apply the concept of extrema

More information