Levitin-Polyak well-posedness of constrained vector optimization problems (Q995942): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-006-9050-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083486495 / rank | |||
Normal rank | |||
Revision as of 01:24, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Levitin-Polyak well-posedness of constrained vector optimization problems |
scientific article |
Statements
Levitin-Polyak well-posedness of constrained vector optimization problems (English)
0 references
10 September 2007
0 references
In this paper, three types of Levitin-Polyak well-posedness and generalized Levitin-Polyak well-posednesses for a general constrained vector optimization problem are introduced. Criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posedness are investigated. And the convergence of a class of penalty methods under the assumption of a type of generalized Levitin-Polyak well-posedness is considered.
0 references
minimizing sequence
0 references
penalty type methods
0 references
