summary:The paper deals with an adaptation of Newton's method for solving nonlinear programming problems. The adaptation is derived by replacing the gradient direction in Rosen's method by Newton's direction and both its convergence and practical aspects are discussed. Convergence properties of another adaptation of Newton's method (suggested by Hájek) are studied, too
We consider a variant of inexact Newton Method, called Newton-MR, in which the least-squares sub-pro...
Newton’s method is a basic tool in numerical analysis and numerous applications, including operation...
In this dissertation we investigate some applications of variational analysis in optimization theory...
summary:The paper deals with an adaptation of Newton's method for solving nonlinear programming prob...
summary:The paper deals with an adaptation of Newton's method for solving nonlinear programming prob...
A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:R...
. We introduce a new method for maximizing a concave quadratic function with bounds on the variables...
Optimization is the process of maximizing or minimizing a desired objective function while satisfyin...
AbstractThis paper is an introduction to Newton, a constraint programming language over nonlinear re...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
This thesis begins with the history of operations research and introduces two of its major branches,...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
Abstract We discuss the question of which features and/or properties make a method for solving a giv...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
We consider a variant of inexact Newton Method, called Newton-MR, in which the least-squares sub-pro...
Newton’s method is a basic tool in numerical analysis and numerous applications, including operation...
In this dissertation we investigate some applications of variational analysis in optimization theory...
summary:The paper deals with an adaptation of Newton's method for solving nonlinear programming prob...
summary:The paper deals with an adaptation of Newton's method for solving nonlinear programming prob...
A Newton algorithm for solving the problem minimize f(x) subject to g(x) - 0, where f:Rn - R and g:R...
. We introduce a new method for maximizing a concave quadratic function with bounds on the variables...
Optimization is the process of maximizing or minimizing a desired objective function while satisfyin...
AbstractThis paper is an introduction to Newton, a constraint programming language over nonlinear re...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
This thesis begins with the history of operations research and introduces two of its major branches,...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
Abstract We discuss the question of which features and/or properties make a method for solving a giv...
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in...
We consider a variant of inexact Newton Method, called Newton-MR, in which the least-squares sub-pro...
Newton’s method is a basic tool in numerical analysis and numerous applications, including operation...
In this dissertation we investigate some applications of variational analysis in optimization theory...
DOI
Add to ORKG