On the Convergence of Pattern Search Algorithms

DOI10.1137/S1052623493250780MaRDI QIDQ3124033zbMATH OpenWikidataFDO

Authors Virginia J. Torczon

Publication date 2 April 1998

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1052623493250780

zbMATH Keywords

global convergencedirect search methodspattern search methodsnonlinear unconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• On the Local Convergence of Pattern Search
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• On the Convergence of the Multidirectional Search Algorithm
• On the convergence of grid-based methods for unconstrained optimization
• Analysis of Generalized Pattern Searches

Cited in

(only showing first 100 items - show all)

• A generating set search method using curvature information
• On the Local Convergence of Pattern Search
• Frame based methods for unconstrained optimization
• Extended global convergence framework for unconstrained optimization
• A trust-region-based derivative free algorithm for mixed integer programming
• Identification and control of delayed SISO systems through pattern search methods
• Economic oriented stochastic optimization in process control using Taguchi's method
• Survey of derivative-free optimization
• A discussion on variational analysis in derivative-free optimization
• Optimizing color picture tubes by high-cost nonlinear programming
• Direct search algorithm for bilevel programming problems
• A restarted and modified simplex search for unconstrained optimization
• A subclass of generating set search with convergence to second-order stationary points
• A decomposition algorithm for unconstrained optimization problems with partial derivative information
• Clustering Sequence Data with Mixture Markov Chains with Covariates Using Multiple Simplex Constrained Optimization Routine (MSiCOR)
• Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
• Solving nonlinear programming problems with noisy function values and noisy gradients
• OLYMPUS optimization under geological uncertainty
• On the optimal order of worst case complexity of direct search
• A deterministic method for continuous global optimization using a dense curve
• Derivative-free methods for mixed-integer constrained optimization problems
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• Second-Order Behavior of Pattern Search
• scientific article; zbMATH DE number 6449348 (Why is no real title available?)
• Damage location in mechanical structures by multi-objective pattern search
• Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
• Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
• Performance of a coordinate search ANN training algorithm
• Generalized pattern search methods for linearly equality constrained optimization problems
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization
• Integrated crew organization and work zone scheduling for network-wide daily road pavement rehabilitation
• Generalized pattern search methods for a class of nonsmooth optimization problems with structure
• Generalized pattern search methods for control of stable, unstable and integrating systems with unknown delay under step input
• Managing congestion and emissions in transportation networks with dynamic carbon credit charge scheme
• A nonmonotone hybrid method for nonlinear systems^∗
• Pattern search method for determination of DAEM kinetic parameters from nonisothermal TGA data of biomass
• A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization
• Constrained global optimization of expensive black box functions using radial basis functions
• A derivative-free method for the system of nonlinear equations
• Nonparametric estimation of the mixing distribution in logistic regression mixed models with random intercepts and slopes
• Sensitivity of optimal shapes of artificial grafts with respect to flow parameters
• Exploiting Problem Structure in Derivative Free Optimization
• Improved load forecasting model based on two-stage optimization of gray model with fractional order accumulation and Markov chain
• An initialization strategy for high-dimensional surrogate-based expensive black-box optimization
• Integrated region-based segmentation using color components and texture features with prior shape knowledge
• A non-monotone pattern search approach for systems of nonlinear equations
• Derivative-free robust optimization for circuit design
• Worst case complexity of direct search
• Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems
• Multi‐directional search to optimize neural network error function
• Parallel radial basis function methods for the global optimization of expensive functions
• Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
• On the convergence of grid-based methods for unconstrained optimization
• (Non) convergence results for the differential evolution method
• Decomposition in derivative-free optimization
• A variance-based method to rank input variables of the mesh adaptive direct search algorithm
• Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty
• A quasi-Newton based pattern search algorithm for unconstrained optimization
• The generalized proximal point algorithm with step size 2 is not necessarily convergent
• Hypersonic flight vehicle trajectory optimization using pattern search algorithm
• Generating set search using simplex gradients for bound-constrained black-box optimization
• The limitation of neural nets for approximation and optimization
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
• Optimal experimental design: formulations and computations
• A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization
• Trust region model management in multidisciplinary design optimization
• Shape optimization of pulsatile ventricular assist devices using FSI to minimize thrombotic risk
• Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
• Grid-based methods for linearly equality constrained optimization problems
• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
• Geometry of interpolation sets in derivative free optimization
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
• Full-low evaluation methods for derivative-free optimization
• Use of a biobjective direct search algorithm in the process design of material science applications
• Empirical study of the improved UNIRANDI local search method
• Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework
• Cryptanalysis of a classical chaos-based cryptosystem with some quantum cryptography features
• Derivative-free methods for mixed-integer nonsmooth constrained optimization
• A frame-based conjugate gradients direct search method with radial basis function interpolation model
• Pattern search in the presence of degenerate linear constraints
• Exploiting problem structure in pattern search methods for unconstrained optimization
• Two decades of blackbox optimization applications
• Approximate dynamic programming via direct search in the space of value function approximations
• A solution method for mixed-variable constrained blackbox optimization problems
• Linear equalities in blackbox optimization
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
• Algorithm 1053: SOLNP+: a derivative-free solver for constrained nonlinear optimization
• Stochastic congestion pricing among multiple regions: competition and cooperation
• Unconstrained derivative-free optimization by successive approximation
• A deterministic algorithm to compute the cosine measure of a finite positive spanning set
• A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
• Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
• Uniform simplex of an arbitrary orientation
• Performance of derivative free search ANN training algorithm with time series and classification problems
• Phase-dependence of response curves to deep brain stimulation and their relationship: from essential tremor patient data to a Wilson-Cowan model
• Identification and control of delayed unstable and integrative LTI MIMO systems using pattern search methods
• SMART-MC: Characterizing the Dynamics of Multiple Sclerosis Therapy Transitions Using a Covariate-Based Markov Model
• Frame-based ray search algorithms in unconstrained optimization

This page was built for publication: On the Convergence of Pattern Search Algorithms

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