Frame based methods for unconstrained optimization

DOI10.1023/A:1026429319405zbMath0983.90074OpenAlexW1493249195MaRDI QIDQ5925722

Ian D. Coope, Price, C. J.

Publication date: 19 February 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026429319405

zbMATH Keywords

convergence analysisderivative free optimizationdirect search methodsframe based methodspositive basis methodsunconstrained optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (34)

Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases ⋮ Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions ⋮ Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods ⋮ Spent potliner treatment process optimization using a MADS algorithm ⋮ Grid restrained Nelder-Mead algorithm ⋮ Exploiting Problem Structure in Derivative Free Optimization ⋮ A frame-based conjugate gradients direct search method with radial basis function interpolation model ⋮ Optimal combination of aircraft maintenance tasks by a novel simplex optimization method ⋮ Grid-based methods for linearly equality constrained optimization problems ⋮ An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions ⋮ Globally convergent evolution strategies for constrained optimization ⋮ Adapting derivative free optimization methods to engineering models with discrete variables ⋮ Equal angle distribution of polling directions in direct-search methods ⋮ Mesh adaptive direct search with second directional derivative-based Hessian update ⋮ Frame-based ray search algorithms in unconstrained optimization ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions ⋮ Spherical Mesh Adaptive Direct Search for Separating Quasi-Uncorrelated Sources by Range-Based Independent Component Analysis ⋮ Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions ⋮ Globally convergent evolution strategies ⋮ Unconstrained derivative-free optimization by successive approximation ⋮ Direct search methods on reductive homogeneous spaces ⋮ Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle ⋮ A convergent variant of the Nelder--Mead algorithm ⋮ A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ Mesh adaptive direct search with simplicial Hessian update ⋮ Mesh adaptive direct search algorithms for mixed variable optimization ⋮ Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ Derivative-free optimization methods ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization

Uses Software

• DFO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• On the Convergence of Pattern Search Algorithms
• Direct Search Methods on Parallel Machines
• On the Convergence of the Multidirectional Search Algorithm
• Theory of Positive Linear Dependence

This page was built for publication: Frame based methods for unconstrained optimization