The primal-dual active set strategy as a semismooth Newton method

被引:686
作者
Hintermüller, M
Ito, K
Kunisch, K
机构
[1] Graz Univ, Inst Math, A-8010 Graz, Austria
[2] N Carolina State Univ, Raleigh, NC 27695 USA
关键词
complementarity problems; function spaces; semismooth Newton method;
D O I
10.1137/S1052623401383558
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper addresses complementarity problems motivated by constrained optimal control problems. It is shown that the primal-dual active set strategy, which is known to be extremely efficient for this class of problems, and a specific semismooth Newton method lead to identical algorithms. The notion of slant differentiability is recalled and it is argued that the max-function is slantly differentiable in L-p-spaces when appropriately combined with a two-norm concept. This leads to new local convergence results of the primal-dual active set strategy. Global unconditional convergence results are obtained by means of appropriate merit functions.
引用
收藏
页码:865 / 888
页数:24
相关论文
共 25 条
[1]   Primal-dual strategy for constrained optimal control problems [J].
Bergounioux, M ;
Ito, K ;
Kunisch, K .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1999, 37 (04) :1176-1194
[2]   A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems [J].
Bergounioux, M ;
Haddou, M ;
Hintermüller, M ;
Kunisch, K .
SIAM JOURNAL ON OPTIMIZATION, 2000, 11 (02) :495-521
[3]  
Berman A., 1979, COMPUTER SCI SCI COM
[5]   Smoothing methods and semismooth methods for nondifferentiable operator equations [J].
Chen, XJ ;
Nashed, Z ;
Qi, LQ .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2000, 38 (04) :1200-1216
[6]  
Clarke F. H., 1983, OPTIMIZATION NONSMOO
[7]   A simply constrained optimization reformulation of KKT systems arising from variational inequalities [J].
Facchinei, F ;
Fischer, A ;
Kanzow, C ;
Peng, JM .
APPLIED MATHEMATICS AND OPTIMIZATION, 1999, 40 (01) :19-37
[8]   On finite termination of an iterative method for linear complementarity problems [J].
Fischer, A ;
Kanzow, C .
MATHEMATICAL PROGRAMMING, 1996, 74 (03) :279-292
[9]   FAST ALGORITHMS FOR NONSMOOTH COMPACT FIXED-POINT PROBLEMS [J].
HEINKENSCHLOSS, M ;
KELLEY, CT ;
TRAN, HT .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1992, 29 (06) :1769-1792
[10]   MULTIGRID ALGORITHMS FOR VARIATIONAL-INEQUALITIES [J].
HOPPE, RHW .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1987, 24 (05) :1046-1065