Functional inequalities and theorems of the alternative involving composite functions
From MaRDI portal
Publication:743970
DOI10.1007/s10898-013-0100-zzbMath1298.39024MaRDI QIDQ743970
Publication date: 2 October 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0100-z
functional inequalities; Farkas-type results; alternative type theorems; convex composite problems with conic constraints; nonconvex composite optimization problems; set containments; stable farkas lemma; stable strong duality
49J52: Nonsmooth analysis
39B62: Functional inequalities, including subadditivity, convexity, etc.
46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics
Related Items
Some characterizations of duality for DC optimization with composite functions, New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, A new approach to strong duality for composite vector optimization problems, Optimality conditions and total dualities for conic programming involving composite function, A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems, New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems, Farkas' lemma: three decades of generalizations for mathematical optimization, Stable and total Fenchel duality for composed convex optimization problems, Some dual characterizations of Farkas-type results for fractional programming problems, Extended Farkas's lemmas and strong dualities for conic programming involving composite functions, A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality, New Farkas-type results for vector-valued functions: a non-abstract approach, Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems, Farkas-type results for vector-valued functions with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities
- Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Conjugate duality in convex optimization
- Duality in D. C. programming: The case of several D. C. constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Set containment characterization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Sur les programmes convexes definis dans des espaces vectoriels topologiques
- A closedness condition and its applications to DC programs with convex constraints
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Convex analysis and global optimization
