**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Objective function, Differentiability, the first order

Description

This lecture covers the directional derivative of a continuous function, the concept of differentiability, and the generalization to several functions through gradient and Jacobian matrices, emphasizing the first order. It also includes a summary.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In MOOCs (6)

Instructor

Related concepts (31)

Semi-differentiability

In calculus, a branch of mathematics, the notions of one-sided differentiability and semi-differentiability of a real-valued function f of a real variable are weaker than differentiability. Specifically, the function f is said to be right differentiable at a point a if, roughly speaking, a derivative can be defined as the function's argument x moves to a from the right, and left differentiable at a if the derivative can be defined as x moves to a from the left.

Nowhere continuous function

In mathematics, a nowhere continuous function, also called an everywhere discontinuous function, is a function that is not continuous at any point of its domain. If is a function from real numbers to real numbers, then is nowhere continuous if for each point there is some such that for every we can find a point such that and . Therefore, no matter how close we get to any fixed point, there are even closer points at which the function takes not-nearby values.

Differentiable manifold

In mathematics, a differentiable manifold (also differential manifold) is a type of manifold that is locally similar enough to a vector space to allow one to apply calculus. Any manifold can be described by a collection of charts (atlas). One may then apply ideas from calculus while working within the individual charts, since each chart lies within a vector space to which the usual rules of calculus apply. If the charts are suitably compatible (namely, the transition from one chart to another is differentiable), then computations done in one chart are valid in any other differentiable chart.

Differentiation rules

This is a summary of differentiation rules, that is, rules for computing the derivative of a function in calculus. Unless otherwise stated, all functions are functions of real numbers (R) that return real values; although more generally, the formulae below apply wherever they are well defined — including the case of complex numbers (C). For any value of , where , if is the constant function given by , then . Let and . By the definition of the derivative, This shows that the derivative of any constant function is 0.

Differentiable function

In mathematics, a differentiable function of one real variable is a function whose derivative exists at each point in its domain. In other words, the graph of a differentiable function has a non-vertical tangent line at each interior point in its domain. A differentiable function is smooth (the function is locally well approximated as a linear function at each interior point) and does not contain any break, angle, or cusp. If x0 is an interior point in the domain of a function f, then f is said to be differentiable at x0 if the derivative exists.

Optimization: principles and algorithms - Linear optimization

Introduction to linear optimization, duality and the simplex algorithm.

Optimization: principles and algorithms - Linear optimization

Introduction to linear optimization, duality and the simplex algorithm.

Optimization: principles and algorithms - Network and discrete optimization

Introduction to network optimization and discrete optimization

Optimization: principles and algorithms - Network and discrete optimization

Introduction to network optimization and discrete optimization

Optimization: principles and algorithms - Unconstrained nonlinear optimization

Introduction to unconstrained nonlinear optimization, Newton’s algorithms and descent methods.

Related lectures (34)

Derivability and ContinuityMATH-101(g): Analysis I

Explores derivability, continuity, and composite functions with illustrative examples.

Directional DerivativesMATH-106(en): Analysis II (English)

Explores directional derivatives, their calculation, examples, and cases of lack of continuity.

Continuous Functions and DerivativesMATH-101(e): Analysis I

Covers the theorem of the intermediate value, derivatives, and their geometric interpretation.

Derivatives and FunctionsMATH-101(e): Analysis I

Covers the theorem of the intermediate value, corollaries, and geometric interpretation of derivatives.

Tangent to Graph of a FunctionMATH-101(c): Analysis I

Explores finding the equation of the tangent line to a function's graph at a point.