l1 solution of linear inequalities

Authors: Pinar M.1; Chen B.2

Source: IMA Journal of Numerical Analysis, Volume 19, Number 1, January 1999 , pp. 19-37(19)

Publisher: Oxford University Press

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

The numerical solution of a possible inconsistent system of linear inequalities in the l1 sense is considered. The non-differentiable l1 norm minimization problem is approximated by a piecewise quadratic Huber smooth function. A continuation algorithm is designed to find an l1 solution of the inequality system. In the case where the linear inequality system is consistent, a solution is obtained by solving any smoothed problem. Otherwise, the algorithm is shown to terminate in a finite number of iterations. We also consider an alternative smoothing scheme which shares similar properties with the first one, but results in an improved computational performance of the continuation algorithm on inconsistent systems. Numerical experiments are conducted to test the efficiency of the algorithm.

Document Type: Original article

Affiliations: 1: Department of Industrial Engineering, Bilkent University, 06533 Ankara, Turkey 2: Department of Management and Systems, Washington State University, Pullman, WA 99164-4736, USA

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$40.03 plus tax

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A