On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Lagrange duality for evenly convex optimization problems
The e-support function of an e-convex set and conjugacy for e-convex functions
Conjugate duality in convex optimization
Convex analysis approach to d. c. programming: Theory, algorithms and applications
Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
Visualizing data as objects by DC (difference of convex) optimization
The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Characterizations of evenly convex sets and evenly quasiconvex functions
On linear systems containing strict inequalities
Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
DC programming: overview.
\(e^{\prime }\)-convex sets and functions: properties and characterizations
Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
Even convexity and optimization. Handling strict inequalities
Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
Inf-convolution, sous-additivite, convexite des fonctions numériques
Analyzing linear systems containing strict inequalities via evenly convex hulls
Fenchel-Lagrange duality for DC infinite programs with inequality constraints
On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
Duality in Vector Optimization
A closedness condition and its applications to DC programs with convex constraints
New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
A comparison of alternative c-conjugate dual problems in infinite convex optimization
Convex Analysis
Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606309)