Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints

DOI10.1007/s12190-010-0407-6zbMath1242.90243OpenAlexW2060728017MaRDI QIDQ545595

Qingying Sun, Zhaoyang Sang

Publication date: 22 June 2011

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-010-0407-6

zbMATH Keywords

convergencegeneralized projectionnon-linear programmingmemory gradientnon-linear equality constraints and in-equality constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface

Cites Work

• Global convergence results of a three term memory gradient method with a non-monotone line search technique
• Memory gradient method for the minimization of functions
• Relation between the memory gradient method and the Fletcher-Reeves method
• Study on a supermemory gradient method for the minimization of functions
• GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints