- unconstrained minimization
- безусловная минимизация
Большой англо-русский и русско-английский словарь. 2001.
unconstrained minimization
Смотреть что такое "unconstrained minimization" в других словарях:
Penalty method — Penalty methods are a certain class of algorithms to solve constraint optimization problems. The penalty method replaces a constraint optimization problem by a series of unconstrained problems whose solutions must converge to the solution of the… … Wikipedia
Ellipsoid method — The ellipsoid method is an algorithm for solving convex optimization problems. It was introduced by Naum Z. Shor, Arkady Nemirovsky, and David B. Yudin in 1972, and used by Leonid Khachiyan to prove the polynomial time solvability of linear… … Wikipedia
Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise … Wikipedia
Naum Z. Shor — Naum Zuselevich Shor Born 1 January 1937(1937 01 01) Kiev, Ukraine, USSR Died 26 February 2006(2006 02 26 … Wikipedia
Coefficient of determination — In statistics, the coefficient of determination R2 is used in the context of statistical models whose main purpose is the prediction of future outcomes on the basis of other related information. It is the proportion of variability in a data set… … Wikipedia
Least squares — The method of least squares is a standard approach to the approximate solution of overdetermined systems, i.e., sets of equations in which there are more equations than unknowns. Least squares means that the overall solution minimizes the sum of… … Wikipedia
Karmarkar's algorithm — is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also polynomial time but… … Wikipedia
Innere-Punkte-Verfahren — sind in der Optimierung eine Klasse von Algorithmen zur Lösung von Optimierungsaufgaben. Ihr Hauptanwendungsgebiet sind lineare oder quadratische Programme. Sie werden aber auch zur Lösung (allgemeiner) nichtlinearer Programme, semidefinierter… … Deutsch Wikipedia
SUMT — Sequential Unconstrained Minimization Technique ( > IEEE Standard Dictionary ) … Acronyms
SUMT — Sequential Unconstrained Minimization Technique ( > IEEE Standard Dictionary ) … Acronyms von A bis Z
SUMT — electr. abbr. Sequential Unconstrained Minimization Techniques … United dictionary of abbreviations and acronyms
