Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming

Keyphrases

• Nonsmooth 100%
• Difference of Convex Functions 100%
• Non-monotone 100%
• Convex Component 100%
• Smooth Function 75%
• Sequence of Solutions 50%
• Accumulation Points 50%
• D-stationary Point 50%
• Numerical Experiments 25%
• Convex Minimization 25%
• Local Curvature 25%
• Weak Convergence 25%
• Extrapolation Scheme 25%
• Almost Surely 25%
• Lipschitz Constant 25%
• Convergence Guarantee 25%
• Slow Convergence 25%
• Search Scheme 25%
• Non-smooth Functions 25%
• Curvature Information 25%
• Nonmonotone Line Search 25%

Mathematics

• Smooth Function 100%
• Convex Programming 100%
• Stationary Point 66%
• Accumulation Point 66%
• Supremum 33%
• Lipschitz Constant 33%
• Weak Convergence 33%
• Convex Minimization 33%
• Numerical Experiment 33%