An unconstrained optimization test functions collection
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A new gradient method via quasi-Cauchy relation which guarantees descent
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- On three-term conjugate gradient algorithms for unconstrained optimization
- A class of test functions for global optimization
- A new adaptive trust region algorithm for optimization problems
- Best practices for comparing optimization algorithms
- Projected affine-scaling interior-point Newton's method with line search filter for box constrained optimization
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- A transformation of accelerated double step size method for unconstrained optimization
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
- Accelerated double direction method for solving unconstrained optimization problems
- Hybrid modification of accelerated double direction method
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models
- A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- A new method with sufficient descent property for unconstrained optimization
- Descent line search scheme using Geršgorin circle theorem
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
- A note on a multiplicative parameters gradient method
- A partitioned PSB method for partially separable unconstrained optimization problems
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables
- A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
- Global convergence property of scaled two-step BFGS method
- Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization
- A new variant of the memory gradient method for unconstrained optimization
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
- Hybridization of accelerated gradient descent method
- A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- Two nonmonotone trust region algorithms based on an improved Newton method
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- A two-step improved Newton method to solve convex unconstrained optimization problems
- Two limited-memory optimization methods with minimum violation of the previous secant conditions
- Adaptive scaling damped BFGS method without gradient Lipschitz continuity
- On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization
- Least-squares-based three-term conjugate gradient methods
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
- Two spectral conjugate gradient methods for unconstrained optimization problems
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- A method for global minimization of functions using the Krawczyk operator
- Two new conjugate gradient methods for unconstrained optimization
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
- A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- The projection technique for two open problems of unconstrained optimization problems
- A note on hybridization process applied on transformed double step size model
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- A survey of gradient methods for solving nonlinear optimization
- Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm
- A novel value for the parameter in the Dai-Liao-type conjugate gradient method
- Accelerated diagonal gradient-type method for large-scale unconstrained optimization
- A class of accelerated subspace minimization conjugate gradient methods
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
- New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
- Some three-term conjugate gradient methods with the new direction structure
- A class of globally convergent three-term Dai-Liao conjugate gradient methods
- An improved nonmonotone adaptive trust region method.
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A modified spectral conjugate gradient method with global convergence
- Two-phase quasi-Newton method for unconstrained optimization problem
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- An improved hybrid-ORBIT algorithm based on point sorting and MLE technique
- A novel self-adaptive trust region algorithm for unconstrained optimization
- A new hybrid algorithm for convex nonlinear unconstrained optimization
- Limited memory BFGS method based on a high-order tensor model
- A nonmonotone hybrid conjugate gradient method for unconstrained optimization
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
This page was built for publication: An unconstrained optimization test functions collection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539529)
