Error bounds of two smoothing approximations for semi-infinite minimax problems
From MaRDI portal
Publication:1048250
DOI10.1007/s10255-008-8828-9zbMath1205.90274OpenAlexW2107829623MaRDI QIDQ1048250
Publication date: 11 January 2010
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-008-8828-9
Related Items (3)
The ridge function representation of polynomials and an application to neural networks ⋮ Unnamed Item ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Nondifferential optimization via adaptive smoothing
- Constrained \(L_ p\) approximation
- An aggregate function method for nonlinear programming
- Optimization. Algorithms and consistent approximations
- Extremal systems of points and numerical integration on the sphere
- A non-interior continuation method for generalized linear complementarity problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- Smooth Optimization Methods for Minimax Problems
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- A smoothing-out technique for min—max optimization
- Variational Analysis
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Smoothing method for minimax problems
This page was built for publication: Error bounds of two smoothing approximations for semi-infinite minimax problems
