On Classes of Generalized Convex Functions, Gordan–Farkas Type Theorems, and Lagrangian Duality

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.102, Iss.2, 1999-08, pp. : 315-343

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Generalized Fenchel’s Conjugation Formulas and Duality for Abstract Convex Functions

By Jeyakumar V. Rubinov A. Wu Z.

Journal of Optimization Theory and Applications, Vol. 132, Iss. 3, 2007-03 ,pp. : 441-458

Springer Publishing Company

Access to resources Recommend Favorite

Complete characterizations of stable Farkas’ lemma and cone-convex programming duality

By Jeyakumar V.

Mathematical Programming, Vol. 114, Iss. 2, 2008-08 ,pp. : 335-347

Springer Publishing Company

Access to resources Recommend Favorite

Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization

By Liu Qian

Optimization, Vol. 57, Iss. 5, 2008-01 ,pp. : 655-667

Taylor & Francis Ltd

Access to resources Recommend Favorite

Farkas-type Results for Max-functions and Applications

By Boţ Radu I. Wanka Gert

Positivity, Vol. 10, Iss. 4, 2006-11 ,pp. : 761-777

Springer Publishing Company

Access to resources Recommend Favorite

Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions

By Mishra S.

Mathematical Methods of Operations Research, Vol. 67, Iss. 3, 2008-06 ,pp. : 493-504

Springer Publishing Company

Access to resources Recommend Favorite