Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
From MaRDI portal
Recommendations
- Convexlike alternative theorems and mathematical programming
- Alternative theorems and optimality conditions with weakened convexity
- Theorems of the alternative for inequality-equality systems and optimality conditions
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
Cites work
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Abstract Kuhn-Tucker theorems
- Convex Analysis
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
- scientific article; zbMATH DE number 3933858 (Why is no real title available?)
- scientific article; zbMATH DE number 3672000 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 1046022 (Why is no real title available?)
- scientific article; zbMATH DE number 1139561 (Why is no real title available?)
- scientific article; zbMATH DE number 750721 (Why is no real title available?)
- Inequality systems and optimization
- Nonconvex theorems of the alternative and minimization
- On the image of a constrained extremum problem and some applications to the existence of a minimum
- Perfect duality for convexlike programs
- Solvability results for sublinear functions and operators
- Sufficient conditions for the existence of multipliers and Lagrangian duality in abstract optimization problems
- Theorems of the alternative and optimality conditions
- Über das von-Neumannsche Minimax-Theorem
Cited in
(26)- Alternative theorems and optimality conditions with weakened convexity
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- On first order optimality conditions for vector optimization
- A theorem of the alternative with an arbitrary number of inequalities and quadratic programming
- On equivalent results in minimax theory
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Optimality and duality in vector optimization problems involving arcwise connected \(d\)-type-I functions over cones
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Image space approach and subdifferentials of integral functionals
- A sharp Lagrange multiplier theorem for nonlinear programs
- Nonlinear programming via König's maximum theorem
- Sufficient Conditions for Nonsmoothr-Invexity
- On alternative theorems and necessary conditions for efficiency
- Convexlike alternative theorems and mathematical programming
- Optimality conditions for vector optimisation with set-valued maps
- Strong Lagrange duality and the maximum principle for nonlinear discrete time optimal control problems
- General theorems of the alternative in variable ordering structures
- On the Fritz John saddle point problem for differentiable multiobjective optimization
- scientific article; zbMATH DE number 6729884 (Why is no real title available?)
- Theorems of the alternative for inequality-equality systems and optimality conditions
- Generalized ( F, , , )-d-V-univex functions and non-smooth alternative theorems
- Generalized constraint qualifications and optimality conditions for set-valued optimization problems
- Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
- Generalized Motzkin theorems of the alternative and vector optimization problems
- Moreau-Rockafellar theorems for nonconvex set-valued maps
This page was built for publication: Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291813)
