Levitin-Polyak well-posedness of constrained vector optimization problems

X. X. Huang, Xiaoqi Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

52 Citations (Scopus)


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 languageEnglish
Pages (from-to)287-304
Number of pages18
JournalJournal of Global Optimization
Issue number2
Publication statusPublished - 1 Feb 2007


  • (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


Dive into the research topics of 'Levitin-Polyak well-posedness of constrained vector optimization problems'. Together they form a unique fingerprint.

Cite this