AbstractA new algorithm for function minimization is presented. The new algorithm is based upon homogeneous functions rather than quadratic models. A consequence of this is that (n + 2) step convergence is obtained for homogeneous functions and that no one-dimensional search is required. Preliminary numerical tests indicate that on general functions the algorithm is superior to the well-known Fletcher and Powell method
This outstanding text for graduate students and researchers proposes improvements to existing algori...
The solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of mi...
WOS: 000269239900010The paper deals with a method for global minimization of increasing positively h...
AbstractA new algorithm for function minimization is presented. The new algorithm is based upon homo...
AbstractRecently, an algorithm for function minimization was presented, based upon an homogeneous, r...
A new accelerated gradient method for finding the minimum of a function f(x) whose variables are unc...
A new accelerated gradient method for finding the minimum of a function f(x) whose variables are unc...
AbstractA new gradient algorithm (LFOPC) for unconstrained minimization, requiring no line searches ...
Four algorithms of dual matrices for function minimization introduced in Ref. 1 are tested through s...
In [1], Nesterov has introduced an optimal algorithm with constant step-size, with is th...
AbstractA polynomial programming problem is a nonlinear programming problem where the objective func...
The nine quadratically convergent algorithms for function minimization appearing in Ref. 1 are teste...
A constrained minimax problem is converted to minimization of a sequence of unconstrained and contin...
The paper deals with a method for global minimization of increasing positively homogeneous functions...
AbstractA new algorithm for unconstrained optimization is presented which is based on a modified one...
This outstanding text for graduate students and researchers proposes improvements to existing algori...
The solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of mi...
WOS: 000269239900010The paper deals with a method for global minimization of increasing positively h...
AbstractA new algorithm for function minimization is presented. The new algorithm is based upon homo...
AbstractRecently, an algorithm for function minimization was presented, based upon an homogeneous, r...
A new accelerated gradient method for finding the minimum of a function f(x) whose variables are unc...
A new accelerated gradient method for finding the minimum of a function f(x) whose variables are unc...
AbstractA new gradient algorithm (LFOPC) for unconstrained minimization, requiring no line searches ...
Four algorithms of dual matrices for function minimization introduced in Ref. 1 are tested through s...
In [1], Nesterov has introduced an optimal algorithm with constant step-size, with is th...
AbstractA polynomial programming problem is a nonlinear programming problem where the objective func...
The nine quadratically convergent algorithms for function minimization appearing in Ref. 1 are teste...
A constrained minimax problem is converted to minimization of a sequence of unconstrained and contin...
The paper deals with a method for global minimization of increasing positively homogeneous functions...
AbstractA new algorithm for unconstrained optimization is presented which is based on a modified one...
This outstanding text for graduate students and researchers proposes improvements to existing algori...
The solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of mi...
WOS: 000269239900010The paper deals with a method for global minimization of increasing positively h...