A unified approach to the feasible direction methods for nonlinear programming with linear constraints (Q1058461)

From MaRDI portal
Revision as of 11:58, 14 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A unified approach to the feasible direction methods for nonlinear programming with linear constraints
scientific article

    Statements

    A unified approach to the feasible direction methods for nonlinear programming with linear constraints (English)
    0 references
    0 references
    0 references
    1984
    0 references
    We introduce an algorithm with parameters for solving nonlinear programming problems with linear constraints. The algorithm is of the feasible direction method type. It is convergent under rather simple conditions. When these parameters are specified, we have many well-known algorithms as its special cases. Still more, many new algorithms can be derived from this general model.
    0 references
    general algorithmic model
    0 references
    convergence analysis
    0 references
    linear constraints
    0 references
    feasible direction method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references