Optimality conditions for quasi-solutions of vector optimization problems (Q261981): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Bienvenido Jiménez / rank | |||
Normal rank | |||
Property / review text | |||
In this paper, the authors deal with quasi-solutions of constrained vector optimization problems. These solutions are a kind of approximate minimal solutions and they are motivated by the Ekeland variational principle. They introduce several notions of quasi-minimality based on free disposal sets and characterize these solutions through scalarization and Lagrange multiplier rules. When the problem fulfills certain convexity assumptions, these results are obtained by using linear separation and the Fenchel subdifferential. In the nonconvex case, they are stated by using the so-called Gerstewitz (Tammer) nonlinear separation functional and the Mordukhovich subdifferential. | |||
Property / review text: In this paper, the authors deal with quasi-solutions of constrained vector optimization problems. These solutions are a kind of approximate minimal solutions and they are motivated by the Ekeland variational principle. They introduce several notions of quasi-minimality based on free disposal sets and characterize these solutions through scalarization and Lagrange multiplier rules. When the problem fulfills certain convexity assumptions, these results are obtained by using linear separation and the Fenchel subdifferential. In the nonconvex case, they are stated by using the so-called Gerstewitz (Tammer) nonlinear separation functional and the Mordukhovich subdifferential. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Paulo Mbunga / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C46 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6560475 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimal quasi-solution | |||
Property / zbMATH Keywords: minimal quasi-solution / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximate solution | |||
Property / zbMATH Keywords: approximate solution / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vector optimization problem | |||
Property / zbMATH Keywords: vector optimization problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
free disposal set | |||
Property / zbMATH Keywords: free disposal set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scalarization | |||
Property / zbMATH Keywords: scalarization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiplier rules | |||
Property / zbMATH Keywords: multiplier rules / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
limiting subdifferential | |||
Property / zbMATH Keywords: limiting subdifferential / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
coradiant set | |||
Property / zbMATH Keywords: coradiant set / rank | |||
Normal rank |
Revision as of 14:37, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimality conditions for quasi-solutions of vector optimization problems |
scientific article |
Statements
Optimality conditions for quasi-solutions of vector optimization problems (English)
0 references
29 March 2016
0 references
In this paper, the authors deal with quasi-solutions of constrained vector optimization problems. These solutions are a kind of approximate minimal solutions and they are motivated by the Ekeland variational principle. They introduce several notions of quasi-minimality based on free disposal sets and characterize these solutions through scalarization and Lagrange multiplier rules. When the problem fulfills certain convexity assumptions, these results are obtained by using linear separation and the Fenchel subdifferential. In the nonconvex case, they are stated by using the so-called Gerstewitz (Tammer) nonlinear separation functional and the Mordukhovich subdifferential.
0 references
minimal quasi-solution
0 references
approximate solution
0 references
vector optimization problem
0 references
free disposal set
0 references
scalarization
0 references
multiplier rules
0 references
limiting subdifferential
0 references
coradiant set
0 references