References in zbMATH (referenced in 29 articles , 1 standard article )

Showing results 1 to 20 of 29.
Sorted by year (citations)

1 2 next

  1. Audet, Charles; Hare, Warren: Algorithmic construction of the subdifferential from directional derivatives (2018)
  2. Bagirov, A. M.; Ugon, J.: Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (2018)
  3. Dolgopolik, M. V.: A convergence analysis of the method of codifferential descent (2018)
  4. Golestani, M.; Sadeghi, H.; Tavan, Y.: Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency (2018)
  5. Hare, W.; Planiden, C.: Computing proximal points of convex functions with inexact subgradients (2018)
  6. Khan, Kamil A.; Larson, Jeffrey; Wild, Stefan M.: Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components (2018)
  7. Hare, W.; Sagastizábal, C.; Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information (2016)
  8. Yousefpour, Rohollah: Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (2016)
  9. Akbari, Z.; Yousefpour, R.; Reza Peyghami, M.: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (2015)
  10. Bagirov, Adil M.; Ugon, Julien; Mirzayeva, Hijran G.: Nonsmooth optimization algorithm for solving clusterwise linear regression problems (2015)
  11. Ozturk, Gurkan; Bagirov, Adil M.; Kasimbeyli, Refail: An incremental piecewise linear classifier based on polyhedral conic separation (2015)
  12. Bagirov, Adil; Karmitsa, Napsu; Mäkelä, Marko M.: Introduction to nonsmooth optimization. Theory, practice and software (2014)
  13. Bagirov, Adil M.; Ugon, Julien; Webb, Dean; Ozturk, Gurkan; Kasimbeyli, Refail: A novel piecewise linear classifier based on polyhedral conic and max-min separabilities (2013)
  14. Bagirov, A. M.; Jin, L.; Karmitsa, N.; Al Nuaimat, A.; Sultanova, N.: Subgradient method for nonconvex nonsmooth optimization (2013)
  15. Deb, Kalyanmoy; Gupta, Shivam; Dutta, Joydeep; Ranjan, Bhoomija: Solving dual problems using a coevolutionary optimization algorithm (2013)
  16. Hare, W.; Nutini, J.: A derivative-free approximate gradient sampling algorithm for finite minimax problems (2013)
  17. Long, Qiang; Wu, Changzhi: A quasisecant method for solving a system of nonsmooth equations (2013)
  18. Mäkelä, Marko M.; Karmitsa, Napsu; Bagirov, Adil: Subgradient and bundle methods for nonsmooth optimization (2013)
  19. Karmitsa, N.; Bagirov, A. M.: Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (2012)
  20. Karmitsa, N.; Bagirov, A.; Mäkelä, M. M.: Comparing different nonsmooth minimization methods and software (2012)

1 2 next