PNEW

Algorithm 811: NDA: algorithms for nondifferentiable optimization We present four basic Fortran subroutines for nondifferentiable optimization with simple bounds and general linear constraints. Subroutine PMIN, intended for minimax optimization, is based on a sequential quadratic programming variable metric algorithm. Subroutines PBUN and PNEW, intended for general nonsmooth problems, are based on bundle-type methods. Subroutine PVAR is based on special nonsmooth variable metric methods. Besides the description of methods and codes, we propose computational experiments which demonstrate the efficiency of this approach.


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

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

1 2 3 next

  1. Lv, Jian; Pang, Li-Ping; Meng, Fan-Yun: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (2018)
  2. Astorino, A.; Gaudioso, M.; Gorgone, E.: A method for convex minimization based on translated first-order approximations (2017)
  3. Fendl, Hannes; Neumaier, Arnold; Schichl, Hermann: Certificates of infeasibility via nonsmooth optimization (2017)
  4. Mahdavi-Amiri, N.; Shaeiri, M.: An adaptive competitive penalty method for nonsmooth constrained optimization (2017)
  5. Ovcharova, Nina: On the coupling of regularization techniques and the boundary element method for a hemivariational inequality modelling a delamination problem (2017)
  6. Dao, Minh N.; Gwinner, Joachim; Noll, Dominikus; Ovcharova, Nina: Nonconvex bundle method with application to a delamination problem (2016)
  7. Drori, Yoel; Teboulle, Marc: An optimal variant of Kelley’s cutting-plane method (2016)
  8. Hare, W.; Sagastizábal, C.; Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information (2016)
  9. Nagesseur, Ludovic: A bundle method using two polyhedral approximations of the $\epsilon $-enlargement of a maximal monotone operator (2016)
  10. Ou, Yigui; Lin, Haichan: An ODE-like nonmonotone method for nonsmooth convex optimization (2016)
  11. Stechlinski, Peter G.; Barton, Paul I.: Generalized derivatives of differential-algebraic equations (2016)
  12. Yousefpour, Rohollah: Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (2016)
  13. Yuan, Gonglin; Meng, Zehong; Li, Yong: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (2016)
  14. Yuan, Gonglin; Wei, Zengxin: A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (2016)
  15. Akbari, Z.; Yousefpour, R.; Reza Peyghami, M.: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (2015)
  16. Scott, Joseph K.; Barton, Paul I.: Reachability analysis and deterministic global optimization of DAE models (2015)
  17. Wechsung, Achim; Scott, Joseph K.; Watson, Harry A. J.; Barton, Paul I.: Reverse propagation of McCormick relaxations (2015)
  18. Bagirov, Adil; Karmitsa, Napsu; Mäkelä, Marko M.: Introduction to nonsmooth optimization. Theory, practice and software (2014)
  19. Burachik, Regina S.; Freire, Wilhelm P.; Kaya, C. Yalçın: Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (2014)
  20. Hare, W. L.; Lucet, Y.: Derivative-free optimization via proximal point methods (2014)

1 2 3 next