A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach (Q1849498)

From MaRDI portal
Revision as of 18:59, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
scientific article

    Statements

    A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2002
    0 references
    analytic center
    0 references
    BFGS quasi-Newton approximations
    0 references
    constrained optimization
    0 references
    infeasible iterates
    0 references
    interior point algorithm
    0 references
    line-search
    0 references
    primal-dual method
    0 references
    shift and slack variables
    0 references
    superlinear convergence
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references