Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints (Q756120)

From MaRDI portal
Revision as of 14:00, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
scientific article

    Statements

    Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints (English)
    0 references
    0 references
    1990
    0 references
    The author studies a continuous-time nonlinear programming problem of the type: \[ (P)\quad \inf \quad \phi (x)=\int^{T}_{0}f(x)(t)dt,\quad g(x)(t)\leq 0,\quad h(x)(t)=0. \] Here f,g,h are nonlinear operators from \(W^ n[0,T]\) to C[0,T], \(C^ p[0,T]\) and \(C^ q[0,T]\) respectively, \(W^ n[0,T]\) is the space of all absolutely continuous vector functions with Lebesgue square-integrable derivative on [0,T]. Under some generalized convexity assumptions necessary optimality criteria and duality relations for (P) are obtained. The technique is based on a general minmax approach used in the paper first to treat an abstract constrained optimization problem in a Banach space. The results are then restated and specialized for (P). Some other classes of optimization problems to which those are applicable are discussed.
    0 references
    saddle-point optimality conditions
    0 references
    Lagrangian duality relations
    0 references
    continuous-time nonlinear programming
    0 references
    nonlinear operators
    0 references
    necessary optimality criteria
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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