zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Optimisation de procédés chimiques par une méthode de gradient réduit. I: Présentation de l’algorithme. (French) Zbl 0571.90055

A reduced gradient algorithm, designed for solving the two basic classes of continuous optimization problems in the field of chemical engineering - unit operations optimization and CAD of large-scale processes - is presented in this paper. A great number of bounded variables, an implicit criterion, and a set of linear or nonlinear constraints giving rise to a sparse Jacobian matrix, form the main features of these two classes of problems.

In the case of large-scale linearly constrained problems, involving several hundreds of variables, the algorithm implementation is based both on a partition of the variables and on the use of numerically stable matrix factorizations. Nonlinear constrained problems can also be the means of numerical linearization procedures. In a second article, the algorithm is illustrated by some test problems, involving numerical and chemical engineering examples.

90C06Large-scale problems (mathematical programming)
90C30Nonlinear programming
65K05Mathematical programming (numerical methods)
90C90Applications of mathematical programming