Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Journal of Mathemati...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Mathematical Analysis and Applications
Article
License: Elsevier Non-Commercial
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Mathematical Analysis and Applications
Article . 2002
License: Elsevier Non-Commercial
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Journal of Mathematical Analysis and Applications
Article . 2002 . Peer-reviewed
License: Elsevier Non-Commercial
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2002
Data sources: zbMATH Open
versions View all 4 versions
addClaim

Strict Efficiency in Vector Optimization

Strict efficiency in vector optimization
Authors: Jiménez, Bienvenido;

Strict Efficiency in Vector Optimization

Abstract

The author extends the notion of strict minimum for scalar optimization problems to vector optimization problems. The notion of strict local minimum of order m and strict local minimum for vector optimization problems are introduced. Their properties and characterization are studied for multiobjective problems. Also the notion of super-strict efficiency for multiobjective problems is introduced and it is shown that these notions coincide in the scalar case. The necessary conditions for strict and super-strict minimality of order \(m\) for a multiobjective problem are stated by making use of the directional derivatives already considered by \textit{M. Studniarski} [SIAM J. Control Optim. 24, 1044--1049 (1986; Zbl 0604.49017)] and \textit{M. Studniarski} [SIAM J. Control Optim. 24, 1044--1049 (1986; Zbl 0604.49017)] and \textit{D. E. Ward} [J. Optim. Theory Appl. 80, No. 3, 551--571 (1994; Zbl 0797.90101)]. A necessary and sufficient condition for strict efficiency of order 1 for Hadamard differentiable functions is established followed by a characterization of super-strict efficiency of order 1 for Fréchet differentiable functions. The author claims that this extends to multiobjective problems th sufficient optimality conditions given in Theorem 6.3 of chapter 4 by \textit{M. R. Hestenes} [Optimization Theory: The Finite Dimensional Case, Wiley, New York (1975; Zbl 0327.90015), Krieger, Huntington (1981)].

Keywords

vector optimization, optimality conditions, super-strict minimum, Applied Mathematics, Optimality conditions and duality in mathematical programming, strict minimum, Multi-objective and goal programming, Analysis

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    96
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
96
Top 10%
Top 1%
Top 10%
hybrid