Add to ORKGThe parallel variable metric optimization algorithms of Straeter (1973) and van Laarhoven (1985) are...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
A method for determining numerically local minima of differentiable functions of several variables i...
SIGLEAvailable from British Library Document Supply Centre- DSC:D40466/82 / BLDSC - British Library ...
We present a class of algorithms for solving constrained optimization problems. In the algorithm no...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...
As a first step to the realization of a new computer program to solve general nonlinear optimization...
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
"September, 1982."Bibliography: p. 48-50.Supported by the National Science Foundation under Grant NS...
Optimization problems with many more inequality constraints than variables arise in support-vector m...
Abstract. This is a method for determining numerically local minima of differentiable functions of s...
A family of shifted variable metric methods for unconstrained optimization is investigated. These me...
An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities...
This book makes available a self-contained collection of modern research addressing the general cons...
Thesis (Ph.D.)--University of Washington, 2017Convex optimization is more popular than ever, with ex...
The parallel variable metric optimization algorithms of Straeter (1973) and van Laarhoven (1985) are...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
A method for determining numerically local minima of differentiable functions of several variables i...
SIGLEAvailable from British Library Document Supply Centre- DSC:D40466/82 / BLDSC - British Library ...
We present a class of algorithms for solving constrained optimization problems. In the algorithm no...
In this paper variable metric algorithms are extended to solve general nonlinear programming proble...
As a first step to the realization of a new computer program to solve general nonlinear optimization...
A new family of numerically efficient variable metric or quasi-Newton methods for unconstrained opti...
"September, 1982."Bibliography: p. 48-50.Supported by the National Science Foundation under Grant NS...
Optimization problems with many more inequality constraints than variables arise in support-vector m...
Abstract. This is a method for determining numerically local minima of differentiable functions of s...
A family of shifted variable metric methods for unconstrained optimization is investigated. These me...
An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities...
This book makes available a self-contained collection of modern research addressing the general cons...
Thesis (Ph.D.)--University of Washington, 2017Convex optimization is more popular than ever, with ex...
The parallel variable metric optimization algorithms of Straeter (1973) and van Laarhoven (1985) are...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
A method for determining numerically local minima of differentiable functions of several variables i...