An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
type: Item
instance of: scholarly article
title: An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
zbMATH Open document ID: 1211.90283
author: B. E. Eshmatov
published in: Journal of Optimization Theory and Applications
publication date: 2008-08-21T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 5314918
zbMATH Keywords: minimax problems
zbMATH Keywords: log-sum-exponential smoothing
zbMATH Keywords: active set strategies
MaRDI profile type: Publication
full work available at URL: s10957-008-9355-9
OpenAlex ID: W2060122474
cites work: Q5672476
cites work: Q4226179
cites work: Q4209222
cites work: Optimization. Algorithms and consistent approximations
cites work: Algorithms with adaptive smoothing for finite minimax problems
cites work: Q4163968
cites work: Approximation procedures based on the method of multipliers
cites work: A non-interior continuation method for generalized linear complementarity problems
cites work: Smoothing method for minimax problems
cites work: An aggregate function method for nonlinear programming
cites work: On Penalty and Multiplier Methods for Constrained Minimization
cites work: Q3690580
cites work: How good can polynomial interpolation on the sphere be?
DOI: 10.1007/S10957-008-9355-9
description: scientific article; zbMATH DE number 5314918