On the Convergence of the Pshenichnyi-Pironneau-Polak Minimax Algorithm with an Active Set Strategy
The purpose of this technical note is to present a proof of convergence of the Pshenichnyi-Pironneau-Polak (PPP) minimax algorithm (see Algorithm 2.4.1 in Polak, Optimization: Algorithms and Consistent Approximations, Springer, [ 1997 ]), modified to use an active set strategy. This active set strat...
        Saved in:
      
    
          | Published in | Journal of optimization theory and applications Vol. 138; no. 2; pp. 305 - 309 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | English | 
| Published | 
        Boston
          Springer US
    
        01.08.2008
     Springer Springer Nature B.V  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0022-3239 1573-2878  | 
| DOI | 10.1007/s10957-008-9354-x | 
Cover
| Summary: | The purpose of this technical note is to present a proof of convergence of the Pshenichnyi-Pironneau-Polak (PPP) minimax algorithm (see Algorithm 2.4.1 in Polak, Optimization: Algorithms and Consistent Approximations, Springer, [
1997
]), modified to use an active set strategy. This active set strategy was formally derived in Polak (Optimization: Algorithms and Consistent Approximations, Springer, [
1997
]) from those used in the methods of feasible directions developed by Zoutendijk (Methods of Feasible Directions, Elsevier, [
1960
]) and Polak (Computational Methods in Optimization: A Unified Approach, Academic, [
1971
]). The resulting
ε
-Active PPP algorithm was presented as Algorithm 2.4.34, in Polak (Optimization: Algorithms and Consistent Approximations, Springer, [
1997
]), without any proofs. | 
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23  | 
| ISSN: | 0022-3239 1573-2878  | 
| DOI: | 10.1007/s10957-008-9354-x |