Pages that link to "Item:Q1754446"
From MaRDI portal
The following pages link to Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446):
Displayed 33 items.
- The ABC of DC programming (Q829493) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms'', June 19--25, 2016, Pizzo Calabro, Italy (Q1754442) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← 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)
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- A maximum-margin multisphere approach for binary multiple instance learning (Q2077935) (← links)
- Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← 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)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- Incremental DC optimization algorithm for large-scale clusterwise linear regression (Q2226259) (← links)
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← 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)
- 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)
- Finding the set of global minimizers of a piecewise affine function (Q2679233) (← links)
- Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ (Q5058412) (← links)
- A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← 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)