Some new Farkas-type results for inequality systems with DC functions
From MaRDI portal
Publication:925237
DOI10.1007/s10898-007-9159-8zbMath1182.90071OpenAlexW2056846819MaRDI QIDQ925237
Radu Ioan Boţ, Ioan Bogdan Hodrea, Gert Wanka
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9159-8
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (18)
Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ The hill detouring method for minimizing hinging hyperplanes functions ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs ⋮ On difference convexity of locally Lipschitz functions ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Farkas-type results for max-functions and applications
- Strong duality for generalized convex optimization problems
- Concave duality: Application to problems dealing with difference of functions
- How to regularize a difference of convex functions
- A general duality scheme for nonconvex minimization problems with a strict inequality constraint
- Duality in D. C. programming: The case of several D. C. constraints
- Inequality systems and global optimization
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- DC programming: overview.
- Global minimization of a difference of two convex functions
- Duality in Reverse Convex Optimization
- Solvability theorems for classes of difference convex functions
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Farkas-Type Results With Conjugate Functions
- Convex Analysis
This page was built for publication: Some new Farkas-type results for inequality systems with DC functions
