scientific article; zbMATH DE number 7589572
From MaRDI portal
Publication:5866396
zbMath1497.49021MaRDI QIDQ5866396
Legesse Lemecha, W. Geremew, Adugna Fita
Publication date: 21 September 2022
Full work available at URL: https://pjm.ppu.edu/sites/default/files/papers/PJM_May_%283%292022_337_to_347.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- Lectures on convex optimization
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
- A new efficient algorithm based on DC programming and DCA for clustering
- Minimizing differences of convex functions with applications to facility location and clustering
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Optimization based DC programming and DCA for hierarchical clustering
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Convex Analysis
This page was built for publication: