The following pages link to On the nonmonotone line search (Q5959912):
Displaying 50 items.
- A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems (Q2350863) (← links)
- A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- A nonmonotone inexact Newton method for unconstrained optimization (Q2359404) (← links)
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment (Q2361517) (← links)
- Trace-penalty minimization for large-scale eigenspace computation (Q2398478) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← 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)
- 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)
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- An ODE-based nonmonotone method for unconstrained optimization problems (Q2511365) (← links)
- Barzilai-Borwein-like methods for the extreme eigenvalue problem (Q2514702) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
- The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← 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 harmonic framework for stepsize selection in gradient methods (Q2701417) (← 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)
- Projected gradient algorithms for optimization over order simplices (Q2926073) (← links)
- A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization (Q2931168) (← links)
- A nonmonotone ODE-based method for unconstrained optimization (Q2935398) (← links)
- Assessing the potential of interior point barrier filter line search methods: nonmonotone<i>versus</i>monotone approach (Q3111135) (← links)
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization (Q3383208) (← links)
- Convergence properties of inexact projected gradient methods (Q3446583) (← links)
- On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
- A Trust Region Algorithm with Memory for Equality Constrained Optimization (Q3514747) (← links)
- Global convergence of conjugate gradient method (Q3622012) (← links)
- Alternate step gradient method* (Q4467169) (← links)
- On the convergence rate of scaled gradient projection method (Q4559401) (← 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)
- An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation (Q5031230) (← 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)
- Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems (Q5094911) (← links)
- (Q5096719) (← links)
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization (Q5277958) (← links)
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems (Q5739606) (← links)
- Adaptive surface-related multiple subtraction using sparse norm minimization method (Q5746703) (← 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)
- A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering (Q6056240) (← links)
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (Q6109887) (← links)
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems (Q6157998) (← links)
