×
Huang, X. X.; Yang, X. Q.

Levitin-Polyak well-posedness of constrained vector optimization problems. (English) Zbl 1149.90133

J. Glob. Optim. 37, No. 2, 287-304 (2007).
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.
Reviewer: Zhang Xian (Xiamen)

Cited in 38 Documents

MSC:

90C29 Multi-objective and goal programming
49K40 Sensitivity, stability, well-posedness

Keywords:

minimizing sequence; penalty type methods
PDF BibTeX XML Cite
\textit{X. X. Huang} and \textit{X. Q. Yang}, J. Glob. Optim. 37, No. 2, 287--304 (2007; Zbl 1149.90133)
Full Text: DOI

References:

[1] Bednarczuk E., Penot J.P. (1992) Metrically well-set minimization problems. Appl. Math. Optim. 26, 273–285 · Zbl 0762.90073
[2] Bosch P., Jourani A., Henrion R. (2004) Sufficient conditions for error bounds and applications. Appl. Math. Optim. 50, 161–181 · Zbl 1176.90585
[3] Deng S. (2003) Coercivity properties and well-posedness in vector optimization. RAIRO Oper. Res. 37, 195–208 · Zbl 1070.90095
[4] Dontchev A.L., Rockafellar R.T. (2004) Regularity properties and conditioning in variational analysis and optimization. Set-Valued Analysis, 12, 79–109 · Zbl 1046.49021
[5] Dontchev A.L., Zolezzi T. Well-Posed Optimization Problems, Lecture Notes in Mathematics, 1543. Springer, Berlin (1993) · Zbl 0797.49001
[6] Furi M., Vignoli A. (1970) About well-posed minimization problems for functionals in metric spaces. J. Optim. Theory Appl. 5, 225–229 · Zbl 0188.48802
[7] Huang X.X. (2000) Extended well-posed properties of vector optimization problems. J. Optim. Theory Appl. 106, 165–182 · Zbl 1028.90067
[8] Huang X.X., Yang X.Q. (2001) Duality and exact penalization for vector optimization via augmented Lagrangian. J. Optim. Theory Appl. 111, 615–640 · Zbl 1002.90059
[9] Huang X.X., Yang X.Q., Teo K.L. (2004) Characterzing the nonemptiness and compactness of solution set of a convex optimization problem with cone constraints and applications. J. Optim. Theory Appl. 123: 391–407
[10] Konsulova A.S., Revalski J.P. (1994) Constrained convex optimization problems-well-posedness and stability. Num. Funct. Anal. Optim. 15, 889–907 · Zbl 0830.90119
[11] Kuratowski C. Topologie, vol. 1. Panstwowe Wydawnicto Naukowa, Warszawa, Poland (1958)
[12] Levitin E.S, Polyak B.T. (1966) Convergence of minimizing sequences in conditional extremum problems. Soviet Math. Dokl. 7, 764–767 · Zbl 0161.07002
[13] Luc D.T. (1989) Theory of Vector Optimization. Springer-Verlag, Berlin · Zbl 0688.90051
[14] Lucchetti R., Revalski J. (1995) (eds.) Recent Developments in Well-Posed Variational Problems. Kluwer Academic Publishers, Dordrecht · Zbl 0823.00006
[15] Pang J.S. (1997) Error bounds in mathematical programming. Math. Program. 79, 299–332 · Zbl 0887.90165
[16] Tykhonov A.N. (1966) On the stability of the functional optimization problem. USSR Compt. Math. Math. Phys. 6: 28–33 · Zbl 0212.23803
[17] Zolezzi T. (1996) Extended well-posedness of optimization problems. J. Optim. Theory Appl. 91, 257–266 · Zbl 0873.90094
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.