A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees | PERPUSTAKAAN UNIVERSITAS KATOLIK PARAHYANGAN

Pencarian berdasarkan :

Pencarian terakhir:

Text

A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees

Bansil, Mohit - Nama Orang; Kitagawa, Jun - Nama Orang;

We introduce and prove convergence of a damped Newton algorithm to approximate solutions of the semidiscrete optimal transport problem with storage fees, corresponding to a problem with hard capacity constraints. This is a variant of the optimal transport problem arising in queue penalization problems and has applications to data clustering. Our result is novel, as it is the first numerical method with proven convergence for this variant problem; additionally, the algorithm applies to the classical semidiscrete optimal transport problem but does not require any connectedness assumptions on the support of the source measure, in contrast with existing results. Furthermore we find some stability results of the associated Laguerre cells. All of our results come with quantitative rates. We also present some numerical examples.

Ketersediaan

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

Informasi Detail

Judul Seri: SIAM JOURNAL ON OPTIMIZATION; Vol.31 No.4 October-December 2021
No. Panggil: -
Penerbit: : .,
Deskripsi Fisik: p. 2586-2613
Bahasa: English
ISBN/ISSN: -
Klasifikasi: NONE
Tipe Isi: -
Tipe Media: -
Tipe Pembawa: -
Edisi: -
Subjek: NUMERICAL ANALYSIS
CALCULUS OF VARIATIONS
OPTIMAL TRANSPORT
Info Detail Spesifik: https://doi.org/10.1137/20M1357226
Pernyataan Tanggungjawab: Mohit Bansil, Jun Kitagawa

Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas

Tidak Ada Data

Komentar

Anda harus masuk sebelum memberikan komentar