An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems (Q289076): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-015-0812-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1800296562 / rank | |||
Normal rank |
Revision as of 14:25, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems |
scientific article |
Statements
An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems (English)
0 references
27 May 2016
0 references
The authors consider a vector optimization problem (VP) of a locally Lipschitz function with mixed locally Lipschitz constraints and construct an unconstrained problem (P) by using a vector penalty function. They prove that when the penalty parameter is sufficiently large, saddle points of the associated Lagrange vector function provide weak efficient solutions of the penalized problem (P), and under certain assumptions on the feasible set, (weak) efficient solutions of (P) are also (weak) efficient solutions of (VP).
0 references
vector optimization
0 references
penalty function
0 references
saddle point
0 references
Lagrange function
0 references