Inequality systems and optimization

DOI10.1016/0022-247X(91)90221-KzbMath0734.90089OpenAlexW1990600811MaRDI QIDQ811410

Joachim Gwinner, Vaithilingam Jeyakumar

Publication date: 1991

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(91)90221-k

zbMATH Keywords

constrained optimizationminimax problemsnonconvex functionsinfinite number of constraintsgeneral inequality systemsnoncompact setssolvability theorems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Linear inequalities of matrices (15A39) Existence of solutions for minimax problems (49J35) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (26)

Image convexity of generalized systems with infinite-dimensional image and applications ⋮ New methods for characterizing \(D\)-\(\eta\)-properly prequasi-invex functions ⋮ Three kinds of generalized convexity ⋮ Generalized Motzkin theorems of the alternative and vector optimization problems ⋮ A solution method for combined semi-infinite and semi-definite programming ⋮ Lagrangian duality for minimization of nonconvex multifunctions ⋮ Unnamed Item ⋮ A solvability theorem and minimax fractional programming ⋮ Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness. ⋮ SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ Fenchel's duality theorem for nearly convex functions ⋮ Stability, stabilization and duality for linear time-varying systems ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ A relaxed cutting plane method for semi-infinite semi-definite programming ⋮ Quantitative Analysis for Perturbed Abstract Inequality Systems in Banach Spaces ⋮ On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality ⋮ Duality for semi-definite and semi-infinite programming ⋮ Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions ⋮ On convex generalized systems ⋮ Theorems of the alternative and optimality conditions for convexlike and general convexlike programming ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming ⋮ Convexlike and concavelike conditions in alternative, minimax, and minimization theorems ⋮ Infinite-dimensional convex programming with applications to constrained approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence theorems and extreme solutions for inequalities concerning convex functions or linear transformations
• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Inequality systems and minimax theorems
• Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
• Closed images of convex multivalued mappings in linear topological spaces with applications
• On systems of convex inequalities
• Duality and regularization for inf-sup problems
• Zero duality gaps in infinite-dimensional programming
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• Theorems of the alternative and optimality conditions
• Fan's theorem concerning systems of convex inequalities and its applications
• On infinite systems of linear inequalities
• Adjoint Process Duality
• A Minimax Theorem
• On a theorem of Ky Fan and its application to nondifferentiame optimization
• Non-convex infinite games
• Mathematical methods of game and economic theory
• A generalized Farkas lemma with applications to quasidifferentiable programming
• Nonconvex theorems of the alternative and minimization
• Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
• Minimax Theorems

This page was built for publication: Inequality systems and optimization