Regularization algorithms for linear copositive problems
نویسندگان
چکیده
The paper is devoted to the regularization of linear Copositive Programming problems which consists transforming a problem an equivalent form, where Slater condition satisfied and therefore strong duality holds. We describe algorithms based on concept immobile indices understanding important role that these play in feasible sets' characterization. These are compared some procedures developed for more general case convex facial reduction approach. show immobile-index-based approach combined with specifics copositive allows us construct explicit detailed than those already available.
منابع مشابه
Double Optimal Regularization Algorithms for Solving Ill-Posed Linear Problems under Large Noise
A double optimal solution of an n-dimensional system of linear equations Ax = b has been derived in an affine m-dimensional Krylov subspace with m n. We further develop a double optimal iterative algorithm (DOIA), with the descent direction z being solved from the residual equation Az = r0 by using its double optimal solution, to solve ill-posed linear problem under large noise. The DOIA is pro...
متن کاملLow Complexity Regularization of Linear Inverse Problems
Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for recovering the unknown signal is to solve a convex optimization problem that enforces some prior knowledge about its structure. This has proved efficient in man...
متن کاملA Regularization Method for Time-fractional Linear Inverse Diffusion Problems
In this article, we consider an inverse problem for a time-fractional diffusion equation with a linear source in a one-dimensional semi-infinite domain. Such a problem is obtained from the classical diffusion equation by replacing the first-order time derivative by the Caputo fractional derivative. We show that the problem is ill-posed, then apply a regularization method to solve it based on th...
متن کاملFractional regularization matrices for linear discrete ill-posed problems
The numerical solution of linear discrete ill-posed problems typically requires regularization. Two of the most popular regularization methods are due to Tikhonov and Lavrentiev. These methods require the choice of a regularization matrix. Common choices include the identity matrix and finite difference approximations of a derivative operator. It is the purpose of the present paper to explore t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2022
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2022063