A family of shifted variable metric methods for unconstrained optimization is investigated. These methods form a basis for shifted limited-memory variable metric methods introduced in second contribution in proceedings of SANM 2003. We describe basic properties of these methods, establish their global convergence and give conditions for the superlinear rate of convergence. Their efficiency is demonstrated by using extensive numerical experiments
This paper studies a variable metric method for bound constrained optimization problem
A new class of limited-memory variable metric methods for unconstrained minimization is described. A...
Several modifications of the limited-memory variable metric BNS method for large scale un- constrain...
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
AbstractA new family of numerically efficient full-memory variable metric or quasi-Newton methods fo...
In this contribution, a new family of globally convergent limited-memory (LM) variable metric (VM) l...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...
This paper deals with new variable metric algorithms for nonsmooth optimization problems, so-called ...
This paper deals with new variable-metric algorithms for nonsmooth optimization problems, the so-cal...
We present a class of algorithms for solving constrained optimization problems. In the algorithm no...
We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We i...
We develop a class of methods for minimizing a nondifferentiable function which is the maximum of a...
This paper deals with new variable metric algorithms for nonsmooth optimization problems. The author...
SIGLEAvailable from British Library Document Supply Centre- DSC:D40466/82 / BLDSC - British Library ...
Abstract. This is a method for determining numerically local minima of differentiable functions of s...
This paper studies a variable metric method for bound constrained optimization problem
A new class of limited-memory variable metric methods for unconstrained minimization is described. A...
Several modifications of the limited-memory variable metric BNS method for large scale un- constrain...
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
AbstractA new family of numerically efficient full-memory variable metric or quasi-Newton methods fo...
In this contribution, a new family of globally convergent limited-memory (LM) variable metric (VM) l...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...
This paper deals with new variable metric algorithms for nonsmooth optimization problems, so-called ...
This paper deals with new variable-metric algorithms for nonsmooth optimization problems, the so-cal...
We present a class of algorithms for solving constrained optimization problems. In the algorithm no...
We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We i...
We develop a class of methods for minimizing a nondifferentiable function which is the maximum of a...
This paper deals with new variable metric algorithms for nonsmooth optimization problems. The author...
SIGLEAvailable from British Library Document Supply Centre- DSC:D40466/82 / BLDSC - British Library ...
Abstract. This is a method for determining numerically local minima of differentiable functions of s...
This paper studies a variable metric method for bound constrained optimization problem
A new class of limited-memory variable metric methods for unconstrained minimization is described. A...
Several modifications of the limited-memory variable metric BNS method for large scale un- constrain...