scientific article; zbMATH DE number 1748528
From MaRDI portal
Publication:4530408
The paper concerns minimization of \(g(x)-h(x)\) subject to a finite number of constraints \(g_i(x)-h_i(x)\leq0\) and \(x\in K\). Here \(K\) is a compact, convex subset of a topological vector space. The value of the problem is stated in terms of some conjugate functions. There are considered two applications: minimization an a not necessarily convex, but compact set; linear programming with \(0\), \(1\) variables. For the entire collection see [Zbl 0982.00052].
Recommendations
- Some characterizations of duality for DC optimization with composite functions
- The strong duality for DC optimization problems with composite convex functions
- Optimality conditions and duality for DC programming in locally convex spaces
- Duality for nonconvex optimization and its applications
- The stable duality of DC programs for composite convex functions
- Una caracterización dual de optimalidad para optimización convexa
- Duality for nonconvex approximation and optimization.
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Duality for optimization and best approximation over finite intersections
- scientific article; zbMATH DE number 2100861
Cited in
(8)- On the subdifferentiability of the difference of two functions and local minimization
- Duality in D. C. programming: The case of several D. C. constraints
- Characterization and recognition of d.c. functions
- Some characterizations of duality for DC optimization with composite functions
- scientific article; zbMATH DE number 2100861 (Why is no real title available?)
- The directional subdifferential of the difference of two convex functions
- Characterization of d.c. Functions in terms of quasidifferentials
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530408)