Error bounds of two smoothing approximations for semi-infinite minimax problems
type: Item
instance of: scholarly article
title: Error bounds of two smoothing approximations for semi-infinite minimax problems
zbMATH Open document ID: 1205.90274
author: Hong-Xia Yin
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2010-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 5655748
zbMATH Keywords: semi-infinite minimax problem
zbMATH Keywords: smoothing method
zbMATH Keywords: aggregate function
zbMATH Keywords: error bound
zbMATH Keywords: polynomial interpolation
MaRDI profile type: Publication
full work available at URL: s10255-008-8828-9
OpenAlex ID: W2107829623
cites work: Q4163968
cites work: Acceleration of the leastpth algorithm for minimax optimization with engineering applications
cites work: A Regularization Method for Solving the Finite Convex Min-Max Problem
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: An aggregate function method for nonlinear programming
cites work: Nondifferential optimization via adaptive smoothing
cites work: Constrained \(L_ p\) approximation
cites work: A non-interior continuation method for generalized linear complementarity problems
cites work: Smooth Optimization Methods for Minimax Problems
cites work: Optimization. Algorithms and consistent approximations
cites work: Algorithms with adaptive smoothing for finite minimax problems
cites work: Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
cites work: An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
cites work: Variational Analysis
cites work: Q4332850
cites work: Extremal systems of points and numerical integration on the sphere
cites work: A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere
cites work: Smoothing method for minimax problems
cites work: A smoothing-out technique for min—max optimization
cites work: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
DOI: 10.1007/S10255-008-8828-9
description: scientific article; zbMATH DE number 5655748