Supermemory descent methods for unconstrained minimization

DOI10.1007/BF00932655zbMath0304.49023OpenAlexW2015377485MaRDI QIDQ1216859

S. Singh

Publication date: 1976

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00932655

Mathematics Subject Classification ID

Newton-type methods (49M15) Mathematical programming (90C99)

Related Items (13)

A quasi-Newton based pattern search algorithm for unconstrained optimization ⋮ A new class of supermemory gradient methods ⋮ A gradient-related algorithm with inexact line searches ⋮ A new variant of the memory gradient method for unconstrained optimization ⋮ Convergence of memory gradient methods ⋮ Memory gradient method for multiobjective optimization ⋮ A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization ⋮ Convergence of supermemory gradient method ⋮ A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization ⋮ A new descent algorithm with curve search rule ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization ⋮ Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm

Cites Work

• Memory gradient method for the minimization of functions
• A multipoint method of third order
• Study on a supermemory gradient method for the minimization of functions
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• Variable Metric Method for Minimization
• A Quasi-Newton Method with Memory for Unconstrained Function Minimization
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• Variable metric methods of minimisation
• Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
• Conjugate Directions without Linear Searches

This page was built for publication: Supermemory descent methods for unconstrained minimization