Pages that link to "Item:Q1730802"

The following pages link to Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802):

Displaying 13 items.

• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
• DC programming and DCA for enhancing physical layer security via relay beamforming strategies (Q2230771) (← links)
• The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
• An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds (Q2694523) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)