Abstract
In this paper, we consider Levitin-Polyak type well-posedness for a general constrained vector optimization problem. We introduce several types of (generalized) Levitin-Polyak well-posednesses. Criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posedness are investigated. Finally, we consider convergence of a class of penalty methods under the assumption of a type of generalized Levitin-Polyak well-posedness. 2007.
| Original language | English |
|---|---|
| Pages (from-to) | 287-304 |
| Number of pages | 18 |
| Journal | Journal of Global Optimization |
| Volume | 37 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Feb 2007 |
Keywords
- (generalized) Levitin-Polyak well-posedness
- Constrained vector optimization
- Minimizing sequence
- Penalty type methods
ASJC Scopus subject areas
- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics