A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
From MaRDI portal
Publication:2515062
DOI10.1007/s10589-014-9665-9zbMath1316.90065OpenAlexW2081812263MaRDI QIDQ2515062
Luigi Grippo, Francesco Rinaldi
Publication date: 10 February 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3147000
derivative-free optimizationRosenbrock methodHooke-Jeeves methodsimplex gradientcoordinate rotationnonmonotone linesearch techniques
Related Items
Empirical study of the improved UNIRANDI local search method, Exploiting Problem Structure in Derivative Free Optimization, A frame-based conjugate gradients direct search method with radial basis function interpolation model, Nonsmooth spectral gradient methods for unconstrained optimization, A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI, Infeasibility and structural bias in differential evolution, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, Derivative-free optimization methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Derivative-free methods for bound constrained mixed-integer optimization
- A class on nonmonotone stabilization methods in unconstrained optimization
- Nonmonotone derivative-free methods for nonlinear equations
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A generating set search method using curvature information
- Geometry of interpolation sets in derivative free optimization
- A combined global \& local search (CGLS) approach to global optimization
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- Algorithm 909
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Using simplex gradients of nonsmooth functions in direct search methods
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Stopping criteria for linesearch methods without derivatives
- `` Direct Search Solution of Numerical and Statistical Problems
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Nonmonotone Line Search Technique for Newton’s Method
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Benchmarking Derivative-Free Optimization Algorithms
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- CUTEr and SifDec
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Nonlinear Programming
