On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1971709
- A globally convergent trust-region algorithm for unconstrained derivative-free optimization
- On the Convergence of Pattern Search Algorithms
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- Global convergence and stabilization of unconstrained minimization methods without derivatives
Cited in
(51)- A generating set search method using curvature information
- Extended global convergence framework for unconstrained optimization
- Gradient-only approaches to avoid spurious local minima in unconstrained optimization
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- Survey of derivative-free optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Derivative free methodologies for circuit worst case analysis
- A subclass of generating set search with convergence to second-order stationary points
- Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- A decomposition algorithm for unconstrained optimization problems with partial derivative information
- On the convergence of global methods in multiextremal optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- A derivative-free algorithm for unconstrained optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Adaptive state-dependent diffusion for derivative-free optimization
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- scientific article; zbMATH DE number 1971709 (Why is no real title available?)
- Exploiting Problem Structure in Derivative Free Optimization
- A non-monotone pattern search approach for systems of nonlinear equations
- A Derivative-Free Method for Structured Optimization Problems
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- On the convergence of grid-based methods for unconstrained optimization
- Generalized pattern searches with derivative information
- An alternative globalization strategy for unconstrained optimization
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- Unconstrained derivative-free optimization by successive approximation
- A globally convergent trust-region algorithm for unconstrained derivative-free optimization
- Nonmonotone derivative-free methods for nonlinear equations
- Note on global convergence of ODE methods for unconstrained optimization
- Adapting derivative free optimization methods to engineering models with discrete variables
- Numerical nonlinear observers using pseudo-Newton-type solvers
- scientific article; zbMATH DE number 1552032 (Why is no real title available?)
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Worst case complexity bounds for linesearch-type derivative-free algorithms
- Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Retraction-based direct search methods for derivative free Riemannian optimization
- Recent progress in unconstrained nonlinear optimization without derivatives
- Introduction to Derivative-Free Optimization
- New global optimization methods for ship design problems
- Unit commitment in oligopolistic markets by nonlinear mixed variable programming
- THB-splines multi-patch parameterization for multiply-connected planar domains via template segmentation
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- Derivative-free optimization methods
- GLODS: global and local optimization using direct search
- Derivative-free optimization: a review of algorithms and comparison of software implementations
This page was built for publication: On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785871)
