A set-valued Lagrange theorem based on a process for convex vector programming (Q5238195): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2945167894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrange Multiplier Rule in Set-Valued Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrange Multiplier Rule for Multifunctions in Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrange multiplier rule for super efficiency in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis for convex multiobjective programming in abstract spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector maximisation and lagrange multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian duality and cone convexlike functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in vector optimization via augmented Lagrangian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in convex optimization through the circatangent derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: A natural extension of the classical envelope theorem in vector differential programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate maps and duality in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality theory for set-valued functions. I: Fenchel conjugation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fenchel–Rockafellar duality theorem for set-valued optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange duality in set optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometry of cones and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Efficiency in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones with bounded and unbounded bases and reflexivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density of the set of positive proper minimal points in the set of minimal points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems / rank
 
Normal rank

Latest revision as of 19:52, 20 July 2024

scientific article; zbMATH DE number 7122798
Language Label Description Also known as
English
A set-valued Lagrange theorem based on a process for convex vector programming
scientific article; zbMATH DE number 7122798

    Statements

    A set-valued Lagrange theorem based on a process for convex vector programming (English)
    0 references
    0 references
    28 October 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Lagrange multiplier
    0 references
    convex vector optimization
    0 references
    process
    0 references
    optimality conditions
    0 references
    0 references
    0 references
    0 references
    0 references