Pages that link to "Item:Q4883667"
From MaRDI portal
The following pages link to An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization (Q4883667):
Displaying 50 items.
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
- Nonmonotone line search methods with variable sample size (Q2340358) (← links)
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems (Q2350863) (← links)
- A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique (Q2375484) (← links)
- Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters (Q2389479) (← links)
- A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
- A nonmonotone trust-region line search method for large-scale unconstrained optimization (Q2428900) (← links)
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization (Q2439887) (← links)
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
- An unconstrained optimization method using nonmonotone second order Goldstein's line search (Q2464310) (← links)
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values (Q2475129) (← links)
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization (Q2483087) (← links)
- An ODE-based nonmonotone method for unconstrained optimization problems (Q2511365) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization (Q2634354) (← links)
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization (Q2654183) (← links)
- An adaptive nonmonotone line search for multiobjective optimization problems (Q2669601) (← links)
- A nonmonotone Broyden method for unconstrained optimization (Q2778682) (← links)
- A nonmonotone line search method and its convergence for unconstrained optimization (Q2831936) (← links)
- A class of nonmonotone Armijo-type line search method for unconstrained optimization (Q2903129) (← links)
- A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization (Q2931168) (← links)
- A nonmonotone ODE-based method for unconstrained optimization (Q2935398) (← links)
- COMBINATION ADAPTIVE TRUST REGION METHOD BY NON-MONOTONE STRATEGY FOR UNCONSTRAINED NONLINEAR PROGRAMMING (Q3103654) (← links)
- (Q3340639) (← links)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
- A Trust Region Algorithm with Memory for Equality Constrained Optimization (Q3514747) (← links)
- Global convergence of conjugate gradient method (Q3622012) (← links)
- A nonmonotone hybrid method for nonlinear systems<sup>∗</sup> (Q4503112) (← links)
- On the convergence rate of scaled gradient projection method (Q4559401) (← links)
- An adaptive nonmonotone trust region algorithm (Q4622885) (← links)
- An efficient Levenberg–Marquardt method with a new LM parameter for systems of nonlinear equations (Q4643685) (← links)
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems (Q4700279) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization (Q5028578) (← links)
- A non-monotone pattern search approach for systems of nonlinear equations (Q5031793) (← links)
- A nonmonotone gradient method for constrained multiobjective optimization problems (Q5052584) (← links)
- (Q5096719) (← links)
- Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion (Q5132267) (← links)
- An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems (Q5242267) (← links)
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization (Q5248241) (← links)
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization (Q5277958) (← links)
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization (Q5859003) (← links)
- A new nonmonotone line search technique for unconstrained optimization (Q5900212) (← links)
- A new nonmonotone line search technique for unconstrained optimization (Q5919724) (← links)
- On the nonmonotone line search (Q5959912) (← links)