.png){kind=icon}
.png){kind=icon}
Return
Element-by-element preconditioners for large partially separable optimization problems
.png){kind=icon}
OA
AI
DOI：10.1137/S1064827594274796.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the solution of large-scale nonlinear optimization problems by methods which aim to exploit their inherent structure. In particular, are consider the property of partial separability, first studied by Griewank and Toint [Nonlinear Optimization, 1981, pp. 301-312]. A typical minimization method for nonlinear optimization problems approximately solves a sequence of simplified linearized subproblems. In this paper, we explore how partial separability may be exploited by iterative methods for solving these subproblems. We particularly address the issue of computing effective preconditioners for such iterative methods. We concentrate on element-by-element preconditioners which reflect the structure of the problem. We find that the performance of these methods can be considerably improved by amalgamating elements before applying the preconditioners. We report the results of numerical experiments which demonstrate the effectiveness of this approach.
Keywords:
large-scale optimization
partial separability
preconditioned conjugate gradient
element-by-element preconditioners
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available