On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
From MaRDI portal
Publication:2677662
DOI10.1007/s11228-022-00644-1OpenAlexW4282967771MaRDI QIDQ2677662
Publication date: 5 January 2023
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-022-00644-1
optimality conditionslocally convex spaceevenly convex functionDC problemsgeneralized convex conjugation and subdifferentiability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local and global optimality conditions for dc infinite optimization problems
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- The e-support function of an e-convex set and conjugacy for e-convex functions
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A parametric characterization of local optimality
- A note on optimality conditions for DC programs involving composite functions
- 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
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Characterizations of evenly convex sets and evenly quasiconvex functions
- On linear systems containing strict inequalities
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
- A new necessary and sufficient global optimality condition for canonical DC problems
- DC programming: overview.
- \(e^{\prime }\)-convex sets and functions: properties and characterizations
- Even convexity and optimization. Handling strict inequalities
- New global optimality conditions for nonsmooth DC optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- A formula on the approximate subdifferential of the difference of convex functions
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- New duality results for evenly convex optimization problems
- A comparison of alternative c-conjugate dual problems in infinite convex optimization
- Convex Analysis
- Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
This page was built for publication: On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions