Nonconvex theorems of the alternative and minimization

DOI10.1080/02331938708843228zbMath0613.49026OpenAlexW2069882363MaRDI QIDQ4720306

Vaithilingam Jeyakumar, Joachim Gwinner, Bruce D.Craven

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843228

zbMATH Keywords

Lagrange multiplierduality theoremsnon-convex functionsTheorems of the alternativeFuchssteiner and König minimax theorem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35)

Related Items (9)

Global optimization conditions for certain nonconvex minimization problems ⋮ Generalized Motzkin theorems of the alternative and vector optimization problems ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Nonsmooth multiobjective programming ⋮ On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality ⋮ Zero duality gaps in infinite-dimensional programming ⋮ Theorems of the alternative and optimality conditions for convexlike and general convexlike programming ⋮ Inequality systems and optimization ⋮ Convexlike and concavelike conditions in alternative, minimax, and minimization theorems

Cites Work

• Unnamed Item
• Unnamed Item
• Homogeneous programming
• An extension lemma and homogeneous programming
• Inequality systems and minimax theorems
• Perfect duality for convexlike programs
• Sufficient conditions for duality in homogeneous programming
• Theorems of the alternative and optimality conditions
• The fixed point theory of multi-valued mappings in topological vector spaces
• On a theorem of Ky Fan and its application to nondifferentiame optimization
• Convexlike alternative theorems and mathematical programming
• Nonlinear alternative theorems and nondifferentiable programming
• Direct theorems in semi-infinite convex programming
• Characterizations of optimality without constraint qualification for the abstract convex program
• The theorem of the alternative, the key-theorem, and the vector-maximum problem
• 100 Jahre gordanscher alternativsatz für lineare ungleichungen

This page was built for publication: Nonconvex theorems of the alternative and minimization