Abstract
The formulation of the l/sup 1/ minimization problem as an infinite-dimensional linear programming problem is discussed, along with some aspects of the solution process. Two methods are applied simultaneously making it possible to get both upper bounds and lower bounds on the true optimum, and to compute the optimum of the full problem to within any given tolerance. How to determine the size of a truncated problem is considered. The convergence of the optima of the truncated problems to the true optimum is discussed, along with the questions of whether the full solutions of the truncated primal problems converge to a full solution of the original primal problem, and whether the full solutions of the truncated dual problems tend to a full solution of the original dual problem. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
