Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Le Thi Khanh Hien"'
Publikováno v:
Computational Optimization and Applications. 83:247-285
Publikováno v:
SIAM Journal on Mathematics of Data Science. 4:1-25
Autor:
Le Thi Khanh Hien, Chek Beng Chua
Publikováno v:
Set-Valued and Variational Analysis. 29:109-144
We use the concept of barrier-based smoothing approximations to extend the non-interior continuation method, which was proposed by B. Chen and N. Xiu for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions, to an inexact
Autor:
Le Thi Khanh Hien1 KHANHHIENNT@GMAIL.COM, Duy Nhat Phan2 NHATSP@GMAIL.COM, Gillis, Nicolas3 NICOLAS.GILLIS@UMONS.AC.BE
Publikováno v:
Journal of Machine Learning Research. 2023, Vol. 24, p1-41. 41p.
Publikováno v:
2021 29th European Signal Processing Conference (EUSIPCO).
Publikováno v:
Numerical Linear Algebra with Applications
Numerical Linear Algebra with Applications, 2021, 28 (5), ⟨10.1002/nla.2373⟩
Numerical Linear Algebra with Applications, Wiley, 2021, 28 (5), ⟨10.1002/nla.2373⟩
Numerical Linear Algebra with Applications, 2021, 28 (5), ⟨10.1002/nla.2373⟩
Numerical Linear Algebra with Applications, Wiley, 2021, 28 (5), ⟨10.1002/nla.2373⟩
This paper is concerned with improving the empirical convergence speed of block-coordinate descent algorithms for approximate nonnegative tensor factorization (NTF). We propose an extrapolation strategy in-between block updates, referred to as heuris
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38c51f4f63bf211908236411572add1a
https://hal.science/hal-03038513
https://hal.science/hal-03038513
Publikováno v:
Computational Optimization and Applications
Computational optimization and applications
Computational optimization and applications
We introduce and analyze BPALM and A-BPALM, two multi-block proximal alternating linearized minimization algorithms using Bregman distances for solving structured nonconvex problems. The objective function is the sum of a multi-block relatively smoot
Publikováno v:
Journal of optimization theory and applications
Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications
We propose BIBPA, a block inertial Bregman proximal algorithm for minimizing the sum of a block relatively smooth function (that is, relatively smooth concerning each block) and block separable nonsmooth nonconvex functions. We prove that the sequenc
Publikováno v:
Journal of Optimization Theory and Applications. 181:541-566
We consider the problem of minimizing the sum of an average function of a large number of smooth convex components and a general, possibly non-differentiable, convex function. Although many methods have been proposed to solve this problem with the as
Publikováno v:
Operations Research.
Critical infrastructure is inevitably subject to the risk of interdictions, which may potentially cripple its ability to channel resources to fulfill demands at various destinations. Mitigating suc...