Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems (Q1335123): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect duality for convexlike programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexlike alternative theorems and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Kuhn-Tucker theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier rules and the separation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems of the alternative and optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems of the alternative for multifunctions with applications to optimization: General results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Stability for Convex Multivalued Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 17:06, 22 May 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
scientific article

    Statements

    Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems (English)
    0 references
    0 references
    27 September 1994
    0 references
    Consider the optimization problem in an abstract setting \[ \min f(x),\quad\text{subject to } g(x)\leq 0,\quad h(x)= 0, \] where \(x\in X\), \(X\) an abstract set, \(f: X\to R\), \(g: X\to Y\), \(h: X\to Z\), \(Y\) and \(Z\) normed vector spaces. The author first establishes a theorem of the alternative for systems of equalities and inequalities and then obtains an intrinsic multiplier rule and a Lagrangian saddle-point theorem (strong duality theorem). Results strictly related to the present one have been proved by \textit{R. Nehse} [Math. Nachr. 84, 319-327 (1978; Zbl 0392.46007)], \textit{K.-H. Elster} and \textit{R. Nehse} [Lect. Notes Control Inf. Sci. 23, 1-9 (1980; Zbl 0445.90096)], \textit{M. Hayashi} and \textit{H. Komiya} [J. Optimization Theory Appl. 38, 179-189 (1982; Zbl 0471.49033)], \textit{V. Jeyakumar} [Optimization 16, 643-652 (1985; Zbl 0581.90079)], and \textit{S. Simons} [J. Optimization Theory Appl. 58, No. 1, 147-152 (1988; Zbl 0638.90084)].
    0 references
    strong duality theorem
    0 references
    multiplier rule
    0 references
    Lagrangian saddle-point theorem
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references