Pattern search methods for finite minimax problems

DOI10.1007/S12190-009-0266-1MaRDI QIDQ2380874zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2032319
• Smoothing method for minimax problems
• A smoothing iterative method for the finite minimax problem
• A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
• On solving large-scale finite minimax problems using exponential smoothing
• Solving minimax problems: local smoothing versus global smoothing
• A smoothing algorithm for finite min-max-min problems
• New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
• scientific article; zbMATH DE number 17725

Cites work

• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• Analysis of Generalized Pattern Searches
• Convergence results for generalized pattern search algorithms are tight
• Direct Search Methods on Parallel Machines
• Non-linear programming using least pth optimization with extrapolation†
• On the Convergence of Pattern Search Algorithms
• On the Local Convergence of Pattern Search
• Smooth Optimization Methods for Minimax Problems
• Smoothing method for minimax problems

Cited in

(10)

• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• Nonmonotone algorithms for pattern search methods
• Solution of fractional order system of Bagley-Torvik equation using evolutionary computational intelligence
• Finding optimal solutions to several gray pattern instances
• Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems
• Derivative-free optimization methods
• Pattern Search Algorithms for Bound Constrained Minimization
• A smooth method for the finite minimax problem
• Pattern Search Methods for Linearly Constrained Minimization
• Pattern search method for discrete \(L_{1}\)-approximation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380874)