Inequality systems and optimization
From MaRDI portal
constrained optimizationminimax problemsnonconvex functionsinfinite number of constraintsgeneral inequality systemsnoncompact setssolvability theorems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Inequalities and extremum problems involving convexity in convex geometry (52A40) Semi-infinite programming (90C34) Programming in abstract spaces (90C48) Existence of solutions for minimax problems (49J35) Linear inequalities of matrices (15A39)
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
- 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?)
- A Minimax Theorem
- 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
- 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
- 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
(37)- scientific article; zbMATH DE number 4060995 (Why is no real title available?)
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
- scientific article; zbMATH DE number 647234 (Why is no real title available?)
- Analytical linear inequality systems and optimization
- New generalized convexity notion for set-valued maps and application to vector optimization
- Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions
- Generalized input-output inequality systems
- Moreau-Rockafellar theorems for nonconvex set-valued maps
- New methods for characterizing \(D\)-\(\eta\)-properly prequasi-invex functions
- Duality for semi-definite and semi-infinite programming
- Image convexity of generalized systems with infinite-dimensional image and applications
- Inequality systems and minimax theorems
- Lagrangian duality for minimization of nonconvex multifunctions
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- A solvability theorem and minimax fractional programming
- Generalized Motzkin theorems of the alternative and vector optimization problems
- Solvability criteria for some set-valued inequality systems
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- A note on duality in reverse convex optimization
- A solution method for combined semi-infinite and semi-definite programming
- Fenchel's duality theorem for nearly convex functions
- Quantitative analysis for perturbed abstract inequality systems in Banach spaces
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- SEQUENTIAL LAGRANGE MULTIPLIER CONDITIONS FOR MINIMAX PROGRAMMING PROBLEMS
- Complementarity systems in optimization.
- On convex generalized systems
- scientific article; zbMATH DE number 1839777 (Why is no real title available?)
- Near equality and almost convexity of functions with applications to optimization and error bounds
- Three kinds of generalized convexity
- Infinite inequality systems and cardinal revelations
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Inequity averse optimization in operational research
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Stability, stabilization and duality for linear time-varying systems
- Infinite-dimensional convex programming with applications to constrained approximation
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)
