Optimal correction of infeasible equations system as Ax + B|x|= b using ℓ p-norm regularization

نویسندگان

چکیده

Optimal correction of an infeasible equations system as Ax + B|x|= b leads into a non-convex fractional problem. In this paper, regularization method(ℓp-norm, 0 < p 1), is presented to solve mentioned method, the obtained problem can be formulated and nonsmooth optimization which not Lipschitz. The objective function decomposed difference convex functions (DC). For reason, we use special smoothing technique based on DC programming. numerical results for generated show high performance effectiveness proposed method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint

This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.

متن کامل

on the optimal correction of inconsistent matrix equations $ax = b$ and $xc = d$ with orthogonal constraint

this work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $ax = b$ and $xc = d$ with orthogonal constraint. by optimal correction approach, a general representation of the orthogonal solution is obtained. this method is tested on two examples to show that the optimal correction is e ective and highly accurate.

متن کامل

A Mesh Refinement Method for Ax = \ Bx

The aim of this paper is to introduce a simple but efficient mesh refinement strategy for use with inverse iteration for finding one or a few solutions of an ordinary or partial differential eigenproblem of the form Ax «■ \Bx. The focus is upon the case where A and B are symmetric and B is positive definite, although the approaches have a very broad application. A discussion of the combined use...

متن کامل

Optimal Correction of Infeasible System in Linear Equality via Genetic Algorithm

This work is focused on the optimal correction of infeasible system of linear equality. In this paper, for correcting this system, we will make the changes just in the coefficient matrix by using l norm and show that solving this problem is equivalent to solving a fractional quadratic problem. To solve this problem, we use the genetic algorithm. Some examples are provided to illustrate the effi...

متن کامل

Gershgorin Theory for the Generalized Eigenvalue Problem Ax — \ Bx

A generalization of Gershgorin's theorem is developed for the eigenvalue problem Ax = XBx and is applied to obtain perturbation bounds for multiple eigenvalues. The results are interpreted in terms of the chordal metric on the Riemann sphere, which is especially convenient for treating infinite eigenvalues.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Boletim da Sociedade Paranaense de Matemática

سال: 2022

ISSN: ['0037-8712', '2175-1188']

DOI: https://doi.org/10.5269/bspm.44437