Pages that link to "Item:Q331993"

The following pages link to Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993):

Displaying 27 items.

• Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces (Q824790) (← links)
• The ABC of DC programming (Q829493) (← links)
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
• Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
• An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing (Q2059822) (← links)
• Split proximal linearized algorithm and convergence theorems for the split DC program (Q2067889) (← links)
• Copositivity meets D. C. optimization (Q2068809) (← links)
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
• A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning (Q2633537) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming (Q5034939) (← links)
• An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
• A forward-backward algorithm for the DC programming in Hilbert spaces (Q5244142) (← links)
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
• Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
• A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems (Q6141533) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective (Q6497048) (← 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)
• Learning graph Laplacian with MCP (Q6640995) (← links)