Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems | PERPUSTAKAAN UNIVERSITAS KATOLIK PARAHYANGAN

Pencarian berdasarkan :

Pencarian terakhir:

Text

Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems

Qian, Yitian - Nama Orang; Pan, Shaohua - Nama Orang;

This note is concerned with a class of nonmonotone descent methods for minimizing a proper lower semicontinuous Kurdyka–Łojasiewicz (KL) function, which generates a sequence satisfying a nonmonotone decrease condition and a relative error tolerance. Under suitable assumptions, we prove that the whole sequence converges to a limiting critical point of , and, when is a KL function of exponent , the convergence admits a linear rate if and a sublinear rate associated to if . These assumptions are shown to be sufficient and necessary if in addition is weakly convex on a neighborhood of the set of critical points. Our results not only extend the convergence results of monotone descent methods for KL optimization problems but also resolve the convergence problem on the iterate sequence generated by a class of nonmonotone line search algorithms for nonconvex and nonsmooth problems.

Ketersediaan

Barcode		Tipe Koleksi	Nomor Panggil	Lokasi	Status
art146373	null	Artikel		Gdg9-Lt3	Tersedia namun tidak untuk dipinjamkan - No Loan

Informasi Detail

Judul Seri: SIAM JOURNAL ON OPTIMIZATION; Vol.33 No.2 April-June 2023
No. Panggil: -
Penerbit: : .,
Deskripsi Fisik: p. 638-651
Bahasa: English
ISBN/ISSN: -
Klasifikasi: NONE
Tipe Isi: -
Tipe Media: -
Tipe Pembawa: -
Edisi: -
Subjek: GLOBAL CONVERGENCE
KL OPTIMIZATION PROBLEMS
NONMONOTONE DESCENT METHODS
Info Detail Spesifik: https://doi.org/10.1137/22M1469663
Pernyataan Tanggungjawab: Yitian Qian, Shaohua Pan

Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas

Tidak Ada Data

Komentar

Anda harus masuk sebelum memberikan komentar