Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Characterizing Nonemptiness and Compactness of the Solution Set of a Convex Vector Optimization Problem with Cone Constraints and Applications

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, we characterize the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with cone constraints in terms of the level-boundedness of the component functions of the objective on the perturbed sets of the original constraint set. This characterization is then applied to carry out the asymptotic analysis of a class of penalization methods. More specifically, under the assumption of nonemptiness and compactness of the weakly efficient solution set, we prove the existence of a path of weakly efficient solutions to the penalty problem and its convergence to a weakly efficient solution of the original problem. Furthermore, for any efficient point of the original problem, there exists a path of efficient solutions to the penalty problem whose function values (with respect to the objective function of the original problem) converge to this efficient point.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Sawaragi, Y., Nakayama, H., and Tanino, T., Theory of Multiobjective Optimization, Academic Press, New York, NY, 1985.

    Google Scholar 

  2. Auslender, A., Cominetti, R., and Haddou, M., Asymptotical Analysis for Penalty and Barrier Methods in Convex and Linear Programming, Mathematics of Operations Research, Vol. 22, pp. 43–62, 1997.

    Google Scholar 

  3. Auslender, A., Penalty and Barrier Methods: A Unified Approach, SIAM Journal on Optimization, Vol. 10, pp. 211–230, 1999.

    Google Scholar 

  4. Auslender, A., and Teboulle, M., Asymptotic Cones and Functions in Optimization and Variational Inequalities, Springer Monographs in Mathematics, Springer Verlag, New York, NY, 2003.

    Google Scholar 

  5. Gonzaga, C. C., and Castillo, R. A., A Nonlinear Programming Algorithm Based on Noncoercive Penalty Functions, Mathematical Programming, Vol. 96A, pp. 87–101, 2003.

    Google Scholar 

  6. Hiriart-Urruty, X. X., and Lemarechal, C., Convex Analysis and Minimization Algorithms, Springer Verlag, Berlin, Germany, 1993.

    Google Scholar 

  7. Rockafellar, R. T., and Wets, R. J. B., Variational Analysis, Springer Verlag, Berlin, Germany, 1998.

    Google Scholar 

  8. Deng, S., Characterizations of the Nonemptiness and Compactness of Solution Sets in Convex Vector Optimization, Journal of Optimization Theory and Applications, Vol. 96, pp. 123–131, 1998.

    Google Scholar 

  9. Huang, X. X., and Yang, X. Q., Characterizations of the Nonemptiness and Compactness of the Set of Weakly Efficient Solutions for Convex Vector Optimization and Applications, Journal of Mathematical Analysis and Applications, Vol. 264, pp. 270–287, 2001.

    Google Scholar 

  10. Rockafellar, R. T., Convex Analysis, Princeton University Press, Prinecton, New Jesey, 1970.

    Google Scholar 

  11. Luo, Z. Q., Pang, J. S., and Ralph, D., Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge, England, 1996.

    Google Scholar 

  12. Pang, J. S., Error Bounds in Mathematical Programming, Mathematical Programming, Vol. 79, pp. 299–332, 1997.

    Google Scholar 

  13. Clarke, F. H., Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, NY, 1983.

    Google Scholar 

  14. Ruan, G. Z., and Huang, X. X., Weak Calmness, Weak Stability of Multiobjective Programming, and Exact Penalty Functions, Systems Science and Mathematical Sciences, Vol. 12, pp. 148–157, 1992 (in Chinese).

    Google Scholar 

  15. Huang, X. X., and Yang, X. Q., Nonlinear Lagrangian for Multiobjective Optimization Problems and Applications to Duality and Exact Penalization, SIAM Journal on Optimization, Vol. 13, pp. 675–692, 2002.

    Google Scholar 

  16. Huang, X. X., Yang, X. Q., and Teo, K. L., A Sequential Quadratic Penalty Method for Nonlinear Semidefinite Programming, Optimization (to appear).

  17. Huang, X. X., Yang, X. Q., and Teo, K. L., A Lower-Order Penalization Approach to Nonlinear Semidefinite Programs (to appear).

  18. Coope, I. D., and Price, C. J., Exact Penalty Methods for Nonlinear Semi-Infi-nite Programming, Nonconvex Optimization and Applications, Kluwer Academic Publishers, Boston, Massachusetts, Vol. 25, pp. 137–157, 1998.

    Google Scholar 

  19. Khanh, P. Q., Nuong, T. H., and Thera, M., On Duality in Nonconvex Vector Optimization in Banach Spaces Using Augmented Lagrangians, Positivity, Vol. 3, pp. 49–64, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, X.X., Yang, X.Q. & Teo, K.L. Characterizing Nonemptiness and Compactness of the Solution Set of a Convex Vector Optimization Problem with Cone Constraints and Applications. Journal of Optimization Theory and Applications 123, 391–407 (2004). https://doi.org/10.1007/s10957-004-5155-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-004-5155-z

Navigation