The linearization method: Principal concepts and perspective directions (Q1310982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 484105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The linearization method: Principal concepts and perspective directions |
scientific article; zbMATH DE number 484105 |
Statements
The linearization method: Principal concepts and perspective directions (English)
0 references
26 January 1994
0 references
The linearization method for solving a general nonlinear programming problem is applied to three classes of problems closely connected to the usual problem of mathematical programming. Based on the basic ideas of the linearization method, the authors propose three algorithms to solve (a) systems of equalities and inequalities, (b) complementarity problems and (c) multiobjective programming problems. The convergence of the algorithms are discussed.
0 references
linearization
0 references
systems of equalities and inequalities
0 references
complementarity problems
0 references
multiobjective programming
0 references
convergence
0 references
0 references
0.8961904048919678
0 references
0.8110989928245544
0 references
0.8056554794311523
0 references
0.8046970367431641
0 references
