Using Sampling and Simplex Derivatives in Pattern Search Methods
From MaRDI portal
Publication:3503207
DOI10.1137/050646706zbMath1144.65039OpenAlexW2026977976WikidataQ58040605 ScholiaQ58040605MaRDI QIDQ3503207
A. L. Custódio, Luis Nunes Vicente
Publication date: 22 May 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050646706
derivative-free optimizationpattern search methodsmultivariate polynomial interpolationsimplex gradientpoisednesspoll ordering
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Sustainability SI: optimal prices of electricity at public charging stations for plug-in electric vehicles, Calibration by optimization without using derivatives, Full-low evaluation methods for derivative-free optimization, Derivative-free methods for mixed-integer nonsmooth constrained optimization, Efficient unconstrained black box optimization, Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems, Constrained derivative-free optimization on thin domains, Derivative-free optimization: a review of algorithms and comparison of software implementations, A subclass of generating set search with convergence to second-order stationary points, Theoretical connections between optimization algorithms based on an approximate gradient, A derivative-free approximate gradient sampling algorithm for finite minimax problems, An adaptive direct multisearch method for black-box multi-objective optimization, Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework, Compositions of convex functions and fully linear models, Efficient calculation of regular simplex gradients, Nonsmooth spectral gradient methods for unconstrained optimization, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, Improved sampling strategies for ensemble-based optimization, Derivative-Free Optimization for Population Dynamic Models, Mesh adaptive direct search with second directional derivative-based Hessian update, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Filling holes under non-linear constraints, A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions, Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions, A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement, A particle swarm pattern search method for bound constrained global optimization, Pattern search methods framework for beam angle optimization in radiotherapy design, Inexact restoration method for nonlinear optimization without derivatives, Calibration of parameters in dynamic energy budget models using direct-search methods, Black-Box Optimization: Methods and Applications, Large-scale history matching with quadratic interpolation models, An inexact restoration derivative-free filter method for nonlinear programming, An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization, Use of quadratic models with mesh-adaptive direct search for constrained black box optimization, Derivative-free optimization methods for finite minimax problems, Incorporating minimum Frobenius norm models in direct search, Generating set search using simplex gradients for bound-constrained black-box optimization, Mesh adaptive direct search with simplicial Hessian update, A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations, A trust-region-based derivative free algorithm for mixed integer programming, A derivative-free trust region framework for variational data assimilation, An active-set trust-region method for derivative-free nonlinear bound-constrained optimization, Derivative-free optimization methods, A Derivative-Free Method for Structured Optimization Problems, Approximating the diagonal of a Hessian: which sample set of points should be used, Direct Search Based on Probabilistic Descent, Calculus Identities for Generalized Simplex Gradients: Rules and Applications, CONORBIT: constrained optimization by radial basis function interpolation in trust regions, Review and comparison of algorithms and software for mixed-integer derivative-free optimization, The calculus of simplex gradients, Control of dead-time systems using derivative free local search guided population based incremental learning algorithms
Uses Software
