A smoothing-out technique for min—max optimization
- 1 December 1980
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 19 (1) , 61-77
- https://doi.org/10.1007/bf01581628
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new arc algorithm for unconstrained optimizationMathematical Programming, 1978
- Linearly constrained minimax optimizationMathematical Programming, 1978
- Objective function approximations in mathematical programmingMathematical Programming, 1977
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofpInternational Journal of Systems Science, 1976
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear EquationsIMA Journal of Applied Mathematics, 1975
- Nondifferentiable optimization via approximationPublished by Springer Nature ,1975
- Constrained Optimization Using a Nondifferentiable Penalty FunctionSIAM Journal on Numerical Analysis, 1973
- Non-Linear Programming Via Penalty FunctionsManagement Science, 1967
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of DerivativesJournal of the ACM, 1967
- An efficient method for finding the minimum of a function of several variables without calculating derivativesThe Computer Journal, 1964