Local and global optimality conditions for dc infinite optimization problems
From MaRDI portal
Publication:514712
Recommendations
- Optimality conditions for convex and DC infinite optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- scientific article; zbMATH DE number 7448122
Cited in
(25)- A parametric characterization of local optimality
- A note on optimality conditions for DC programs involving composite functions
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- A new necessary and sufficient global optimality condition for canonical DC problems
- Min-sup-type zero duality gap properties for DC composite optimization problem
- New global optimality conditions for nonsmooth DC optimization problems
- A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps
- Qualification and optimality conditions for dc programs with infinite constraints
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Optimality conditions for composite DC infinite programming problems
- Optimality conditions for convex and DC infinite optimization problems
- Necessary optimality conditions for DC infinite programs with inequality constraints
- Necessary conditions for local optimality in difference-of-convex programming
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
- The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
- Optimality conditions and total dualities for conic programming involving composite function
- A forward-backward algorithm for the DC programming in Hilbert spaces
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Optimality conditions and Lagrange dualities for optimization problems involving _c-convex functions
- Refined optimality conditions for differences of convex functions
- On constraint qualifications of a nonconvex inequality
- Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
- Some new Farkas-type results for inequality systems with DC functions
This page was built for publication: Local and global optimality conditions for dc infinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514712)
