Pages that link to "Item:Q2281267"
From MaRDI portal
The following pages link to An inertial algorithm for DC programming (Q2281267):
Displaying 26 items.
- The ABC of DC programming (Q829493) (← links)
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem (Q2023685) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Classification in the multiple instance learning framework via spherical separation (Q2152886) (← links)
- Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← 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)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints (Q6113525) (← links)
- A refined inertial DC algorithm for DC programming (Q6159465) (← links)
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
- A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
- On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search (Q6568924) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
