Convex constrained optimization for large-scale generalized Sylvester equations
From MaRDI portal
Publication:535294
DOI10.1007/s10589-009-9253-6zbMath1220.90088MaRDI QIDQ535294
Khalide Jbilou, Marcos Raydan, Abderrahman Bouhamidi
Publication date: 11 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9253-6
convex optimization; image restoration; generalized Sylvester equation; spectral projected gradient method
Related Items
A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint, An efficient method for solving a matrix least squares problem over a matrix inequality constraint, Paige's algorithm for solving a class of tensor least squares problem, An implicit preconditioning strategy for large-scale generalized Sylvester equations, A generalized matrix Krylov subspace method for TV regularization, A numerical method on the mixed solution of matrix equation \(\sum_{i = 1}^t A_i X_i B_i = E\) with sub-matrix constraints and its application, Conditional gradient Tikhonov method for a convex optimization problem in image restoration, On the minimum-norm least squares solution of the complex generalized coupled Sylvester matrix equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block linear method for large scale Sylvester equations
- Krylov-subspace methods for the Sylvester equation
- Regularization methods for large-scale problems
- Iterative methods for \(X-AXB=C\)
- GMRES, L-curves, and discrete ill-posed problems
- Global FOM and GMRES algorithms for matrix equations
- The triangle method for finding the corner of the L-curve
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Sylvester Tikhonov-regularization methods in image restoration
- Projection methods for large Lyapunov matrix equations
- Low rank approximate solutions to large Sylvester matrix equations
- On the numerical solution of \(AX-XB=C\)
- R-linear convergence of the Barzilai and Borwein gradient method
- Deblurring Images
- Two-Point Step Size Gradient Methods
- Accurate Solutions of Ill-Posed Problems in control theory
- A Hessenberg-Schur method for the problem AX + XB= C
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- On the Goldstein-Levitin-Polyak gradient projection method
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Algorithm 813
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Convex programming in Hilbert space
- Method of Undetermined Coefficients in Linear Differential Systems and the Matrix Equation $YB - AY = F$
- Image Processing and Analysis
- Block Krylov subspace methods for solving large Sylvester equations
