A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent (Q1810966)

From MaRDI portal
Revision as of 10:38, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
scientific article

    Statements

    A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent (English)
    0 references
    0 references
    0 references
    9 June 2003
    0 references
    constrained optimization
    0 references
    nonlinear programming
    0 references
    primal-dual interior-point methods
    0 references
    feasibility
    0 references
    monotone descent
    0 references

    Identifiers