An inexact modified subgradient algorithm for nonconvex optimization

نویسندگان

  • Regina Sandra Burachik
  • C. Yalçin Kaya
  • Musa A. Mammadov
چکیده

We propose and analyze an inexact version of the modified subgradient (MSG) algorithm, which we call the IMSG algorithm, for nonsmooth and nonconvex optimization over a compact set. We prove that under an approximate, i.e. inexact, minimization of the sharp augmented Lagrangian, the main convergence properties of the MSG algorithm are preserved for the IMSG algorithm. Inexact minimization may allow to solve problems with less computational effort. We illustrate this through test problems, including an optimal bang–bang control problem, under several different inexactness schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proximal Bundle Method for Nonconvex Functions with Inexact Oracles

For a class of nonconvex nonsmooth functions, we consider the problem of computing an approximate critical point, in the case of inexact oracles. The latter means that only an inexact function value and an inexact subgradient are available, at any given point. We assume that the errors in function and subgradient evaluations are merely bounded, and in principle need not vanish in the limit. We ...

متن کامل

A proximal bundle method for nonsmooth nonconvex functions with inexact information

For a class of nonconvex nonsmooth functions, we consider the problem of computing an approximate critical point, in the case when only inexact information about the function and subgradient values is available. We assume that the errors in function and subgradient evaluations are merely bounded, and in principle need not vanish in the limit. We examine the redistributed proximal bundle approac...

متن کامل

Inexactness in Bundle Methods for Locally Lipschitz Functions

We consider the problem of computing a critical point of a nonconvex locally Lipschitz function over a convex compact constraint set given an inexact oracle that provides an approximate function value and an approximate subgradient. We assume that the errors in function and subgradient evaluations are merely bounded, and in particular need not vanish in the limit. After some discussion on how t...

متن کامل

Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems

In this paper, we introduce a stochastic projected subgradient method for weakly convex (i.e., uniformly prox-regular) nonsmooth, nonconvex functions—a wide class of functions which includes the additive and convex composite classes. At a high-level, the method is an inexact proximal point iteration in which the strongly convex proximal subproblems are quickly solved with a specialized stochast...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2010