Inequality systems and optimization
From MaRDI portal
constrained optimizationgeneral inequality systemsinfinite number of constraintsminimax problemsnoncompact setsnonconvex functionssolvability theorems
Linear inequalities of matrices (15A39) Existence of solutions for minimax problems (49J35) Nonsmooth analysis (49J52) Inequalities and extremum problems involving convexity in convex geometry (52A40) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semi-infinite programming (90C34) Programming in abstract spaces (90C48)
Recommendations
- Inequality systems and global optimization
- Systems of linear inequalities and linear optimization
- Analytical linear inequality systems and optimization
- Inequality systems and minimax theorems
- scientific article; zbMATH DE number 3912673
- Two differential equation systems for inequality constrained optimization
- scientific article; zbMATH DE number 647234
- A theory of linear inequality systems
- Inequality systems and minimax results without linear structure
- scientific article; zbMATH DE number 4060995
Cites work
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- A generalized Farkas lemma with applications to quasidifferentiable programming
- A Minimax Theorem
- Adjoint Process Duality
- Closed images of convex multivalued mappings in linear topological spaces with applications
- Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
- Duality and regularization for inf-sup problems
- Existence theorems and extreme solutions for inequalities concerning convex functions or linear transformations
- Fan's theorem concerning systems of convex inequalities and its applications
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3494173 (Why is no real title available?)
- scientific article; zbMATH DE number 3222151 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3418210 (Why is no real title available?)
- scientific article; zbMATH DE number 3187148 (Why is no real title available?)
- Inequality systems and minimax theorems
- Mathematical methods of game and economic theory
- Minimax Theorems
- Non-convex infinite games
- Nonasymptotic necessary conditions for nonsmooth infinite optimization problems
- Nonconvex theorems of the alternative and minimization
- On a theorem of Ky Fan and its application to nondifferentiame optimization
- On infinite systems of linear inequalities
- On systems of convex inequalities
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- Theorems of the alternative and optimality conditions
- Zero duality gaps in infinite-dimensional programming
Cited in
(42)- Inequality systems and minimax theorems
- Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
- 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
- Lagrangian duality for minimization of nonconvex multifunctions
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- On convex generalized systems
- New generalized convexity notion for set-valued maps and application to vector optimization
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Three kinds of generalized convexity
- Inequality systems and global optimization
- Solvability criteria for some set-valued inequality systems
- Analytical linear inequality systems and optimization
- New methods for characterizing \(D\)-\(\eta\)-properly prequasi-invex functions
- Theorems of the alternative for systems of convex inequalities
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Infinite inequality systems and cardinal revelations
- Image convexity of generalized systems with infinite-dimensional image and applications
- Inequity averse optimization in operational research
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- Stability, stabilization and duality for linear time-varying systems
- scientific article; zbMATH DE number 4060995 (Why is no real title available?)
- A solvability theorem and minimax fractional programming
- scientific article; zbMATH DE number 1288323 (Why is no real title available?)
- scientific article; zbMATH DE number 647234 (Why is no real title available?)
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Duality for semi-definite and semi-infinite programming
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- scientific article; zbMATH DE number 1839777 (Why is no real title available?)
- A solution method for combined semi-infinite and semi-definite programming
- Near equality and almost convexity of functions with applications to optimization and error bounds
- A note on duality in reverse convex optimization
- Proper subdifferential of set-valued maps and its applications in linear spaces
- A generalization of a theorem of von Neumann
- Complementarity systems in optimization.
- Generalized input-output inequality systems
- Generalized Motzkin theorems of the alternative and vector optimization problems
- Moreau-Rockafellar theorems for nonconvex set-valued maps
- Fenchel's duality theorem for nearly convex functions
This page was built for publication: Inequality systems and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811410)
