Ir al contenido

Documat

A note on constraint qualification for saddle point conditions involving convex and linear affine functions

  • G. Giorgi [1] ; B. Jiménez [2] ; V. Novo [2] Árbol académico
    1. [1] University of Pavia

      University of Pavia

      Pavía, Italia

    2. [2] Universidad Nacional de Educación a Distancia

      Universidad Nacional de Educación a Distancia

      Madrid, España

  • Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 34, Nº. 3, 2026, págs. 389-410
  • Idioma: inglés
  • DOI: 10.1007/s11750-026-00716-7
  • Enlaces
  • Resumen

    • We take into consideration the classical saddle point conditions for programming problems involving convex functions, linear affine functions and a convex set constraint. We prove a nonlinear theorem of the alternative, and we discuss the relationships between the Slater constraint qualification and a constraint qualification proposed by Neustadt (Neustadt LW. Academic Press, New York, pp 323–348,1970) .

  • Referencias bibliográficas
    • Bazaraa MS, Sheraly HD, Shetty CM (1993) Nonlinear programming. Theory, and applications, second ed., John Wiley and Sons, New York
    • Bazaraa MS (1973) A theorem of the alternative with applications to convex programming: optimality, duality and stability. J Math Anal Appl...
    • Bazaraa MS, Shetty CM (1976) Foundations of optimization. Springer-Verlag, Berlin
    • Berge C, Ghouila-Houri A (1962) Programmes. Jeux et Réseaux de Transport, Dunod, Paris
    • Bigi G, Pappalardo M (1999) On Lagrangian saddle points in vector optimization. Generalized convexity for economic and financial decisions....
    • Blum E, Oettli W (1975) Mathematische Optimierung. Grundlagen und Verfahren. Springer-Verlag, Berlin
    • Cambini A (1986) Non-linear separation theorems, duality and optimality conditions. Optimization and related fields. Springer-Verlag, Berlin,...
    • Craven BD, Gwinner J, Jeyakumar V (1987) Nonconvex theorems of the alternative and minimization. Optimization 18:151–163
    • De Klerk E, Roos C, Terlaky T (2004) Nonlinear optimization (CO367). University of Waterloo, Waterloo
    • Dinh N, Jeyakumar V (2014) Farkas’ lemma: three decades of generalizations for mathematical optimization. TOP 22:1–22
    • Dontchev AL, Rockafellar RT (2014) Implicit functions and solution mappings, 2nd edn. A view from variational analysis. Springer, New York
    • Dutta J (2005) Necessary optimality conditions and saddle points for approximate optimization in Banach spaces. TOP 13:127–143
    • Elster KH, Reinhardt R, Schäuble M, Donath G (1977) Einführung in die Nichtlineare Optimierung. BSBB. G. Teubner Verlagsgesellschaft, Leipzig
    • Fan K, Glicksberg I, Hoffman AJ (1957) Systems of inequalities involving convex functions. Proc Am Math Soc 8:617–622
    • Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22:618–630
    • Giannessi F (1984) Theorems of the alternative and optimality conditions. J Optim Theory Appl 42:331–365. Errata corrige J Optim Theory Appl...
    • Giannessi F (1980) Theorems of the alternative, quadratic programs and complementarity problems. Variational inequalities and complementarity...
    • Giorgi G (2002) Osservazioni sui teoremi dell’alternativa non lineari implicanti relazioni di uguaglianza e vincolo insiemistico. In: Optimization...
    • Giorgi G, Jiménez B, Novo V (2023) Basic mathematical programming theory. Springer, Berlin
    • Güler O (2010) Foundations of optimization. Springer, New York
    • Henrion R (1992) On constraint qualifications. J Optim Theory Appl 71:187–196
    • Jaffray JY, Pomerol CH (1989) A direct proof of the Kuhn-Tucker necessary optimality theorem for convex and affine linear inequalities. SIAM...
    • Jeyakumar V (1985) Convexlike alternative theorems and mathematical programming. Optimization 16:643–652
    • Jeyakumar V, Gwinner J (1991) Inequality systems and optimization. J Math Anal Appl 159:51–71
    • Jiménez B, Novo V (2002) Alternative theorems and necessary optimality conditions for directionally differentiable multiobjective programs....
    • Kanniappan P (1983) Necessary conditions for optimality of nondifferentiable convex multiobjective programming. J Optim Theory Appl 40:167–174
    • Karlin S (1959) Mathematical methods and theory in games, programming and economics I. Addison-Wesley Publlishing Company, Reading, Massachusets
    • Kolumban J (1997) On the solvability of nonlinear inequality systems. Ann Univ Sci Budapest 40:131–141
    • Kouada I (1994) Sur la dualité en optmisation vectorielle convexe. RAIRO Oper Res 28:255–281
    • Li ZF, Wang SY (1994) Lagrange multipliers and saddle points in multiobjective programming. J Optim Theory Appl 83:63–81
    • Mangasarian OL (1969) Nonlinear programming. McGraw-Hill, New York
    • Mohan SR, Neogy SK (1995) On invex sets and preinvex functions. J Math Anal Appl 189:901–908
    • Moore JM (1968) Some extensions of the Kuhn-Tucker results in concave programming. Papers in quantitative economics 1. The University Press...
    • Neustadt LW (1970) Sufficient conditions and duality theory for mathematical programming problems in arbitrary linear spaces. Nonlinear programming....
    • Oettli W, Gwinner J (1994) Theorems of the alternative and duality for Inf-Sup problems. Math Oper Res 19:238–256
    • Peterson DW (1973) A review of constraint qualifications in finite-dimensional spaces. SIAM Rev 15:639–654
    • Ponstein J, Klein Haneveld WK (1975) On a general saddle-point condition in normed spaces. Math Progr 9:118–122
    • Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
    • Rödder W (1977) A generalized saddle point theory. Eur J Oper Res 1:55–59
    • Solodov MV (2013) Constraint qualifications. In: Encyclopedia of operations research and management science. Eds Saul I. Gass and Michael...
    • Stoer J, Witzgall C (1970) Convexity and optimization in finite dimensions I. Springer-Verlag, Berlin
    • Takayama A (1985) Mathematical economics. Cambridge University Press, Cambridge
    • Uzawa H (1958) The Kuhn-Tucker theorem in concave programming. Studies in linear and non-linear programming. Stanford University Press, Stanford,...
    • Van Rooyen M, Zhou X, Zlobec S (1994) A saddle-point characterization of Pareto optima. Math Progr 67:77–88
    • Weir T, Mond B (1988) Pre-invex functions in multiple objective optimization. J Math Anal Appl 136:29–38
    • Zeng R (2002) A general Gordan alternative theorem with weakened convexity and its application. Optimization 51:709–717
Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno