On multilevel iterative methods for optimization problems |
| |
Authors: | E. Gelman J. Mandel |
| |
Affiliation: | (1) Computational Mathematics Group, University of Colorado at Denver, 80204 Denver, CO, USA |
| |
Abstract: | This paper is concerned with multilevel iterative methods which combine a descent scheme with a hierarchy of auxiliary problems in lower dimensional subspaces. The construction of auxiliary problems as well as applications to elasto-plastic model and linear programming are described. The auxiliary problem for the dual of a perturbed linear program is interpreted as a dual of perturbed aggregated linear program. Coercivity of the objective function over the feasible set is sufficient for the boundedness of the iterates. Equivalents of this condition are presented in special cases.Supported by NSF under grant DMS-8704169, AFOSR under grant 86-0126, and ONR under Contract N00014-83-K-0104. Consulting for American Airlines Decision Technologies, MD 2C55, P.O. Box 619616, DFW, TX 75261-9616, USA.Supported by NSF under grant DMS-8704169 and AFOSR under grant 86-0126. |
| |
Keywords: | Coercivity quadratic programming linear programming aggregation relaxation multigrid methods |
本文献已被 SpringerLink 等数据库收录! |
|