A derivative-free nonmonotone line-search technique for unconstrained optimization
From MaRDI portal
Publication:935796
DOI10.1016/j.cam.2007.07.017zbMath1149.65041OpenAlexW1986294906MaRDI QIDQ935796
Marcos Raydan, José Mario Martínez, Maria A. Diniz-Ehrhardt
Publication date: 8 August 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.07.017
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Full-low evaluation methods for derivative-free optimization, Geometrical inverse matrix approximation for least-squares problems and acceleration strategies, Descent direction method with line search for unconstrained optimization in noisy environment, A convergent inexact solution method for equilibrium problems, Complex-step derivative approximation in noisy environment, Sobolev seminorm of quadratic functions with applications to derivative-free optimization, Nonsmooth spectral gradient methods for unconstrained optimization, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI, A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, A nonmonotone line search method for noisy minimization, A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations, Stochastic Three Points Method for Unconstrained Smooth Minimization, Derivative-free optimization methods, Direct Search Based on Probabilistic Descent, Nonmonotone line search methods with variable sample size, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Extrapolation methods theory and practice
- Recent progress in unconstrained nonlinear optimization without derivatives
- On trust region methods for unconstrained minimization without derivatives
- A derivation of extrapolation algorithms based on error estimates
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Using simplex gradients of nonsmooth functions in direct search methods
- Two-Point Step Size Gradient Methods
- Testing Unconstrained Optimization Software
- Inexact spectral projected gradient methods on convex sets
- Discrete Newton's method with local variations for solving large-scale nonlinear systems
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems
- On the use of quadratic models in unconstrained minimization without derivatives
- Analysis of a Symmetric Rank-One Trust Region Method
- A Nonmonotone Line Search Technique for Newton’s Method
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Introduction to Shape Optimization
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Quasi-Newton Methods and their Application to Function Minimisation
- Variance algorithm for minimization
