Pattern search methods for finite minimax problems

DOI10.1007/s12190-009-0266-1zbMath1196.65104OpenAlexW2072495804MaRDI QIDQ2380874

Xuesheng Zhang, Jun Mei Ma

Publication date: 12 April 2010

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-009-0266-1

zbMATH Keywords

global convergenceminimax problemspattern search methodssmoothing methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (2)

Solution of fractional order system of Bagley-Torvik equation using evolutionary computational intelligence ⋮ Derivative-free optimization methods

Cites Work

• Convergence results for generalized pattern search algorithms are tight
• On the Convergence of Pattern Search Algorithms
• Smooth Optimization Methods for Minimax Problems
• Direct Search Methods on Parallel Machines
• Non-linear programming using least pth optimization with extrapolation†
• Analysis of Generalized Pattern Searches
• On the Local Convergence of Pattern Search
• Smoothing method for minimax problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Pattern search methods for finite minimax problems