A method for determining numerically local minima of differentiable functions of several variables is presented. In the process of locating each minimum, a matrix which characterizes the behavior of the iunction about the minimum is determined. For a region in which the function depends quadratically on the variables, no more than N iterations are required, where N is the number of variables. By suitable choice of starting values and without modification of the procedure, linear constraints can be imposed upon the variables. (auth
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
The selection of updating formulas for the H matrix and the subproblem of one-dimensional search are...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...
A method is presented for numerically determining local minima of differentiable functions of severa...
A method for determining numerically local minima of differentiable functions of several variables i...
Abstract. This is a method for determining numerically local minima of differentiable functions of s...
We develop a class of methods for minimizing a nondifferentiable function which is the maximum of a...
A special variable metric method is given for finding stationary points of locally Lipschitz continu...
summary:An algorithm for numereical determination of the relative minimum of a function of several v...
SIGLEAvailable from British Library Document Supply Centre- DSC:D40466/82 / BLDSC - British Library ...
A new class of limited-memory variable metric methods for unconstrained minimization is described. A...
Minimization problems often occur in modeling phenomena dealing with real-life applications that now...
Minimization problems often occur in modeling phenomena dealing with real-life applications that now...
Simple derivations, at a level appropriate for an undergraduate computational physics course, of the...
International audienceWe consider the minimization of a function $G$ defined on $R^N$, which is the ...
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
The selection of updating formulas for the H matrix and the subproblem of one-dimensional search are...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...
A method is presented for numerically determining local minima of differentiable functions of severa...
A method for determining numerically local minima of differentiable functions of several variables i...
Abstract. This is a method for determining numerically local minima of differentiable functions of s...
We develop a class of methods for minimizing a nondifferentiable function which is the maximum of a...
A special variable metric method is given for finding stationary points of locally Lipschitz continu...
summary:An algorithm for numereical determination of the relative minimum of a function of several v...
SIGLEAvailable from British Library Document Supply Centre- DSC:D40466/82 / BLDSC - British Library ...
A new class of limited-memory variable metric methods for unconstrained minimization is described. A...
Minimization problems often occur in modeling phenomena dealing with real-life applications that now...
Minimization problems often occur in modeling phenomena dealing with real-life applications that now...
Simple derivations, at a level appropriate for an undergraduate computational physics course, of the...
International audienceWe consider the minimization of a function $G$ defined on $R^N$, which is the ...
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
The selection of updating formulas for the H matrix and the subproblem of one-dimensional search are...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...