CGS algorithms for constrained extremization of functions (Q1246254)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	CGS algorithms for constrained extremization of functions	scientific article

Statements

scholarly article

0 references

CGS algorithms for constrained extremization of functions (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF00933435

0 references

R. F. Dennemeyer

0 references

Journal of Optimization Theory and Applications

0 references

publication date

1979

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Extensions of CGS algorithms: Generalized least-square solutions

0 references

Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions

0 references

Unconstrained approach to the extremization of constrained functions

0 references

0 references

The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints

0 references

CGS algorithms for unconstrained minimization of functions

0 references

0 references

0 references

0 references

0 references

full work available at URL

https://doi.org/10.1007/bf00933435

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1246254

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1246254&oldid=36875485"