Pages that link to "Item:Q2399479"

The following pages link to A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479):

Displaying 35 items.

• The ABC of DC programming (Q829493) (← links)
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← 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)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
• A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
• Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
• Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
• Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
• Classification in the multiple instance learning framework via spherical separation (Q2152886) (← links)
• Clusterwise support vector linear regression (Q2189912) (← links)
• Sequential difference-of-convex programming (Q2198538) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← 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)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies (Q5379467) (← links)
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions (Q5883328) (← links)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
• Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints (Q6113525) (← links)
• A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems (Q6173956) (← 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)