Pages that link to "Item:Q2532077"
From MaRDI portal
The following pages link to Study on a supermemory gradient method for the minimization of functions (Q2532077):
Displayed 32 items.
- Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints (Q545595) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
- Global convergence of modified HS conjugate gradient method (Q861482) (← links)
- Global convergence of a memory gradient method for unconstrained optimization (Q861515) (← links)
- A new class of supermemory gradient methods (Q865511) (← links)
- Strong global convergence of an adaptive nonmonotone memory gradient method (Q870222) (← links)
- On the convergence of a new hybrid projection algorithm (Q882531) (← links)
- Global convergence of a memory gradient method without line search (Q949285) (← links)
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← links)
- Generalized conjugate directions (Q1102706) (← links)
- A supermemory gradient projection algorithm for optimization problems with nonlinear constraints (Q1210265) (← links)
- Supermemory descent methods for unconstrained minimization (Q1216859) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- Extensions of CGS algorithms: Generalized least-square solutions (Q1235497) (← links)
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables (Q1259272) (← links)
- Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer (Q1836281) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Numerical experiments on quadratically convergent algorithms for function minimization (Q2536596) (← links)
- Quadratically convergent algorithms and one-dimensional search schemes (Q2553146) (← links)
- Numerical experiments on dual matrix algorithms for function minimization (Q2560774) (← links)
- Memory gradient method for multiobjective optimization (Q2700431) (← links)
- New conjugate gradient-like methods for unconstrained optimization (Q2926084) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- Optimal simultaneous maximum<i>a posteriori</i>estimation of states, noise statistics and parameters I. Algorithm (Q3895369) (← links)
- A local MM subspace method for solving constrained variational problems in image recovery (Q6162148) (← links)