On the rate of convergence of two minimax algorithms
type: Item
instance of: scholarly article
title: On the rate of convergence of two minimax algorithms
zbMATH Open document ID: 0793.90079
DOI: 10.1007/BF00940037
author: E. J. Wiest
author: Elijah Polak
published in: Journal of Optimization Theory and Applications
publication date: 1994-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J35
zbMATH DE Number: 557630
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: composite nondifferentiable optimization
zbMATH Keywords: linear convergence
zbMATH Keywords: minimax problem
zbMATH Keywords: second-order sufficiency condition
describes a project that uses: LSSOL
MaRDI profile type: Publication
cites work: Q3797760
cites work: Q5187067
cites work: Q3677518
cites work: Linearly constrained minimax optimization
cites work: Quadratic rate of convergence of a linearization method for solving discrete minimax problems
cites work: Q3972973
cites work: On the rate of convergence of certain methods of centers
cites work: Q5540119
cites work: On the Pironneau-Polak method of centers
cites work: Algorithms for some minimax problems
cites work: Q4105489
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Simplicial decomposition in nonlinear programming algorithms
cites work: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
cites work: A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
cites work: A regularized decomposition method for minimizing a sum of polyhedral functions
cites work: Optimality conditions for piecewise smooth functions
cites work: Q4051876
description: scientific article; zbMATH DE number 557630