Convex constrained optimization for large-scale generalized Sylvester equations
From MaRDI portal
Publication:535294
DOI10.1007/S10589-009-9253-6zbMATH Open1220.90088OpenAlexW2079996869MaRDI QIDQ535294FDOQ535294
Authors: Khalide Jbilou, M. Raydan, A. 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
Recommendations
- A convex optimization approach for solving large scale linear systems
- scientific article; zbMATH DE number 6318697
- Large-scale convex optimization via saddle point computation
- Iterative solution methods for large-scale constrained saddle-point problems
- A CONVEX APPROXIMATION METHOD FOR LARGE SCALE LINEAR INEQUALITY CONSTRAINED MINIMIZATION
- scientific article; zbMATH DE number 741102
- Conjugate duality for generalized convex optimization problems
- A class of methods for solving large convex systems
- Solving generalized mixed equilibria, variational inequalities, and constrained convex minimization
- Sufficient descent conjugate gradient methods for large-scale optimization problems
convex optimizationimage restorationgeneralized Sylvester equationspectral projected gradient method
Cites Work
- Algorithm 813
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Image Processing and Analysis
- Two-Point Step Size Gradient Methods
- Regularization methods for large-scale problems
- A Hessenberg-Schur method for the problem AX + XB= C
- A Nonmonotone Line Search Technique for Newton’s Method
- Convex programming in Hilbert space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Projection methods for large Lyapunov matrix equations
- Deblurring Images
- Title not available (Why is that?)
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Title not available (Why is that?)
- GMRES, L-curves, and discrete ill-posed problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Low rank approximate solutions to large Sylvester matrix equations
- Block Krylov subspace methods for solving large Sylvester equations
- Global FOM and GMRES algorithms for matrix equations
- On the numerical solution of \(AX-XB=C\)
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
- Methods for the solution ofAXD−BXC=E and its application in the numerical solution of implicit ordinary differential equations
- On the Goldstein-Levitin-Polyak gradient projection method
- Krylov-subspace methods for the Sylvester equation
- Sylvester Tikhonov-regularization methods in image restoration
- On the Barzilai and Borwein choice of steplength for the gradient method
- Inexact spectral projected gradient methods on convex sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- Iterative methods for \(X-AXB=C\)
- The triangle method for finding the corner of the L-curve
- Title not available (Why is that?)
- Accurate Solutions of Ill-Posed Problems in control theory
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Method of Undetermined Coefficients in Linear Differential Systems and the Matrix Equation $YB - AY = F$
- Block linear method for large scale Sylvester equations
Cited In (11)
- A randomized block Douglas-Rachford method for solving linear matrix equation
- An implicit preconditioning strategy for large-scale generalized Sylvester equations
- Tikhonov regularization with conjugate gradient least squares method for large-scale discrete ill-posed problem in image restoration
- 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
- Paige's algorithm for solving a class of tensor least squares problem
- A generalized matrix Krylov subspace method for TV regularization
- On the minimum-norm least squares solution of the complex generalized coupled Sylvester matrix equations
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- Conditional gradient Tikhonov method for a convex optimization problem in image restoration
- An efficient method for solving a matrix least squares problem over a matrix inequality constraint
- An efficient iterative method for solving a class of constrained tensor least squares problem
Uses Software
This page was built for publication: Convex constrained optimization for large-scale generalized Sylvester equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535294)
