Publication

Etude et illustration de méthodes itératives d'optimisation non linéaire

2006
Student Projects

Abstract

Il s'agira d'étudier un certain nombre de méthodes classiques basées notamment sur les gradients des fonctions à optimiser; ces techniques seront analysées du point de vue de leur convergence et le candidat aura pour tâche de les mettre en oeuvre en les programmant, de les comparer et d'élaborer un outil graphique permettant d'illustrer le fonctionnement des méthodes itératives de manière didactique. Il fournira enfin sous une forme aussi compacte que possible des précisions sur les champs d'application de ces techniques et sur leurs qualités respectives.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2006
Student Projects

Abstract

Official source

Related concepts (6)

Marcel Duchamp

Henri-Robert-Marcel Duchamp (UKˈdjuːʃɒ̃, USdjuːˈʃɒ̃,_djuːˈʃɑːmp, maʁsɛl dyʃɑ̃; 28 July 1887 – 2 October 1968) was a French painter, sculptor, chess player, and writer whose work is associated with Cubism, Dada, and conceptual art. He is commonly regarded, along with Pablo Picasso and Henri Matisse, as one of the three artists who helped to define the revolutionary developments in the plastic arts in the opening decades of the 20th century, responsible for significant developments in painting and sculpture.

Newton's method

In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued function. The most basic version starts with a single-variable function f defined for a real variable x, the function's derivative f′, and an initial guess x0 for a root of f. If the function satisfies sufficient assumptions and the initial guess is close, then is a better approximation of the root than x0.

CORDIC

CORDIC (for "coordinate rotation digital computer"), also known as Volder's algorithm, or: Digit-by-digit method Circular CORDIC (Jack E. Volder), Linear CORDIC, Hyperbolic CORDIC (John Stephen Walther), and Generalized Hyperbolic CORDIC (GH CORDIC) (Yuanyong Luo et al.), is a simple and efficient algorithm to calculate trigonometric functions, hyperbolic functions, square roots, multiplications, divisions, and exponentials and logarithms with arbitrary base, typically converging with one digit (or bit) per iteration.