MS-Mo-E-30
Recent Advances in the Solution of Least Squares Problems 2
Date: August 10
Time: 16:00--18:00
Room: 2-2
(Note: Click title to show the abstract.)
Organizer:
Hayami, Ken (National Inst. of Informatics)
Abstract: Least squares problems appear in many important applications in science and engineering. Recently, there have been many developments in the solution of least squares problems of various kinds. Examples are fast and robust solvers for large scale least squares problems combining Krylov subspace methods with efficient preconditioners such as stationary inner iterations or balanced incomplete factorization. There are also advances in other kinds of least squares problems, such as nonnegative constrained least squares problems, nonlinear least squares problems, total least squares problems and integer least squares problems etc. This mini-symposium will address on recent advances in such areas.
MS-Mo-E-30-1
16:00--16:30
Perturbation Analysis and Randomized Algorithms for Large-Scale Total Least Squares Problems
WEI, Yimin (Fudan Univ.)
MS-Mo-E-30-2
16:30--17:00
Some Efficient Hybrid Algorithms for Large Scale Non-negative Constrained Least Squares Problems
Zheng, Bing (Lanzhou Univ.)
Zheng, Yu-Tao (Lanzhou Univ.)
MS-Mo-E-30-3
17:00--17:30
Integer least squares estimation: theory and algorithms
Chang, Xiao-Wen (McGill Univ.)
MS-Mo-E-30-4
17:30--18:00
Modulus Iterative Methods for Box Constrained Least Squares Problems
Zheng, Ning (The Graduate Univ. for Advanced Studies)
Hayami, Ken (National Inst. of Informatics)
Yin, Jun-Feng (Tongji Univ.)
Footnote: Code: Type-Date-Time-Room No. Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00 Room No.: TBA |