Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A supermemory gradient projection algorithm for optimization problem with nonlinear constraints

A supermemory gradient projection algorithm for optimization problem with nonlinear constraints In this paper, by extending concept of the supermemory gradient method for unconstrained optimization problems, we present a supermemory gradient projection algorithm for nonlinear programming with nonlinear constraints. Under some suitable conditions we prove its global convergence. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

A supermemory gradient projection algorithm for optimization problem with nonlinear constraints

Loading next page...
 
/lp/springer-journals/a-supermemory-gradient-projection-algorithm-for-optimization-problem-6HcHzxv6un
Publisher
Springer Journals
Copyright
Copyright © 1992 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02006741
Publisher site
See Article on Publisher Site

Abstract

In this paper, by extending concept of the supermemory gradient method for unconstrained optimization problems, we present a supermemory gradient projection algorithm for nonlinear programming with nonlinear constraints. Under some suitable conditions we prove its global convergence.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 13, 2005

References