A sharp augmented Lagrangian-based method in constrained non-convex optimization

Bagirov A. M., Ozturk G., Kasimbeyli R.

OPTIMIZATION METHODS & SOFTWARE, cilt.34, sa.3, ss.462-488, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 34 Sayı: 3
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1080/10556788.2018.1496431
  • Dergi Adı: OPTIMIZATION METHODS & SOFTWARE
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.462-488
  • Anahtar Kelimeler: Constrained optimization, non-convex optimization, non-smooth optimization, sharp augmented Lagrangian, discrete gradient method, modified subgradient algorithm, MODIFIED SUBGRADIENT ALGORITHM, RADIAL EPIDERIVATIVES, GENERAL CONSTRAINTS, BUNDLE METHOD, DUALITY
  • Anadolu Üniversitesi Adresli: Evet

Özet

In this paper, a novel sharp Augmented Lagrangian-based global optimization method is developed for solving constrained non-convex optimization problems. The algorithm consists of outer and inner loops. At each inner iteration, the discrete gradient method is applied to minimize the sharp augmented Lagrangian function. Depending on the solution found the algorithm stops or updates the dual variables in the inner loop, or updates the upper or lower bounds by going to the outer loop. The convergence results for the proposed method are presented. The performance of the method is demonstrated using a wide range of nonlinear smooth and non-smooth constrained optimization test problems from the literature.