Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
type: Item
instance of: scholarly article
title: Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
zbMATH Open document ID: 1242.90243
author: Qingying Sun
author: Zhaoyang Sang
published in: Journal of Applied Mathematics and Computing
publication date: 2011-06-22T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5911511
zbMATH Keywords: non-linear programming
zbMATH Keywords: generalized projection
zbMATH Keywords: non-linear equality constraints and in-equality constraints
zbMATH Keywords: memory gradient
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: s12190-010-0407-6
OpenAlex ID: W2060728017
cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization
cites work: Q3771509
cites work: Memory gradient method for the minimization of functions
cites work: Study on a supermemory gradient method for the minimization of functions
cites work: Relation between the memory gradient method and the Fletcher-Reeves method
cites work: Q3626416
cites work: GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD
cites work: Global convergence results of a three term memory gradient method with a non-monotone line search technique
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
DOI: 10.1007/S12190-010-0407-6
description: scientific article; zbMATH DE number 5911511