Some new Farkas-type results for inequality systems with DC functions
From MaRDI portal
Publication:925237
DOI10.1007/S10898-007-9159-8zbMATH Open1182.90071OpenAlexW2056846819MaRDI QIDQ925237FDOQ925237
Radu I. 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
Recommendations
- Extended Farkas's lemmas and strong Lagrange dualities for DC infinite programming
- Optimality conditions and total dualities for conic programming involving composite function
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Local and global optimality conditions for dc infinite optimization problems
- Optimality conditions in DC-constrained optimization
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Farkas-type results and duality for DC programs with convex constraints
- Conditions characterizing minima of the difference of functions
- On the merit and penalty functions for the d.c. optimization
- DC programming: overview.
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- DC programming: overview.
- Title not available (Why is that?)
- Convex Analysis
- Duality in D. C. programming: The case of several D. C. constraints
- Inequality systems and global optimization
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- How to regularize a difference of convex functions
- Global minimization of a difference of two convex functions
- Title not available (Why is that?)
- Farkas-type results for max-functions and applications
- Farkas-Type Results With Conjugate Functions
- Title not available (Why is that?)
- Strong duality for generalized convex optimization problems
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Solvability theorems for classes of difference convex functions
- Concave duality: Application to problems dealing with difference of functions
- A general duality scheme for nonconvex minimization problems with a strict inequality constraint
- Duality in Reverse Convex Optimization
Cited In (21)
- Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- 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
- Farkas-type results and duality for DC programs with convex constraints
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Farkas-type results for constrained fractional programming with DC functions
- Farkas-Type Results With Conjugate Functions
- On difference convexity of locally Lipschitz functions
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Stable zero Lagrange duality for DC conic programming
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
This page was built for publication: Some new Farkas-type results for inequality systems with DC functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925237)
