Pages that link to "Item:Q2277146"
From MaRDI portal
The following pages link to A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146):
Displaying 50 items.
- A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations (Q295877) (← links)
- Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search (Q479230) (← links)
- A trust-region approach with novel filter adaptive radius for system of nonlinear equations (Q501965) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method (Q597160) (← links)
- A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization (Q618130) (← links)
- Nonmonotone second-order Wolfe's line search method for unconstrained optimization problems (Q623198) (← links)
- Spectral projected gradient method for stochastic optimization (Q670658) (← links)
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem (Q725751) (← links)
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations (Q742397) (← links)
- Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
- A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization (Q1411546) (← links)
- Global convergence of nonmonotone strategies in parallel methods for block-bordered nonlinear systems (Q1569131) (← links)
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- Nonmonotone adaptive trust-region method for unconstrained optimization problems (Q1774954) (← links)
- A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- 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 nonmonotone inexact Newton method for unconstrained optimization (Q2359404) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- A modified nonmonotone BFGS algorithm for unconstrained optimization (Q2400759) (← links)
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
- Convergence of descent method without line search (Q2570691) (← links)
- A new super-memory gradient method with curve search rule (Q2571993) (← links)
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems (Q2804916) (← links)
- A class of nonmonotone Armijo-type line search method for unconstrained optimization (Q2903129) (← links)
- A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter (Q2903152) (← links)
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results (Q2949516) (← links)
- Assessing the potential of interior point barrier filter line search methods: nonmonotone<i>versus</i>monotone approach (Q3111135) (← links)
- Nonmonotone Learning of Recurrent Neural Networks in Symbolic Sequence Processing Applications (Q3405765) (← links)
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization (Q3539791) (← links)
- A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION (Q3560107) (← links)
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy<sup>∗</sup> (Q4378111) (← links)
- A nonmonotone hybrid method for nonlinear systems<sup>∗</sup> (Q4503112) (← links)
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations (Q4508674) (← links)
- A new class of memory gradient methods with inexact line searches (Q4675852) (← links)
- Some theoretical properties of Feng-Schnabel algorithm for block bordered nonlinear systems (Q4700279) (← links)
- An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps (Q4709746) (← links)
