Overview
Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.
Read the articleAUTHOR
-
Claude LEMARÉCHAL : Engineer, École nationale supérieure d'Électronique, d'Électrotechnique, d'Informatique et d'Hydraulique de Toulouse (ENSEEIHT) Doctor of Science Research Director, Institut national de recherche en Informatique et en Automatique (INRIA)
INTRODUCTION
As a branch of applied mathematics, optimization is now ubiquitous. It was at the end of the last world war that it became truly operational, with the appearance of linear programming to organize American convoys to Europe (the "liberty ships"). It then developed strongly from the 1960s onwards, when non-linear problems could be tackled efficiently, thanks mainly to "quasi-Newton" methods.
The problems dealt with in this article belong to the field of continuous optimization, in which the variables to be optimized can take on a whole continuum of values. This is in contrast to combinatorial problems, in which the aim is to find the best among a finite set of possibilities. This article does not deal with the latter.
Continuous optimization methods are all based on the analysis of functions of several real variables, and all involve constructing an iterative sequence of approximate solutions. It is this type of method that is the subject of this article.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Continuous optimization
Examples of optimization problems
Article included in this offer
"Control and systems engineering"
(
143 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
Bibliography
References
In Engineering Techniques
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
