Best Approximate Solutions of Inconsistent Linear Inequality Systems
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10045/75227
Title: | Best Approximate Solutions of Inconsistent Linear Inequality Systems |
---|---|
Authors: | Goberna, Miguel A. | Hiriart-Urruty, Jean-Baptiste | López Cerdá, Marco A. |
Research Group/s: | Laboratorio de Optimización (LOPT) |
Center, Department or Service: | Universidad de Alicante. Departamento de Matemáticas |
Keywords: | Linear inequality systems | Best uniform solutions | Best L1 solutions | Best least squares solutions |
Knowledge Area: | Estadística e Investigación Operativa |
Issue Date: | Jun-2018 |
Publisher: | Springer Singapore |
Citation: | Vietnam Journal of Mathematics. 2018, 46(2): 271-284. doi:10.1007/s10013-018-0275-1 |
Abstract: | This paper is intended to characterize three types of best approximate solutions for inconsistent linear inequality systems with an arbitrary number of constraints. It also gives conditions guaranteeing the existence of best uniform solutions and discusses potential applications. |
Sponsor: | This work was partially supported by the MINECO of Spain and ERDF of EU, Grant MTM2014-59179-C2-1-P, and by the Australian Research Council, Project DP160100854. |
URI: | http://hdl.handle.net/10045/75227 |
ISSN: | 2305-221X (Print) | 2305-2228 (Online) |
DOI: | 10.1007/s10013-018-0275-1 |
Language: | eng |
Type: | info:eu-repo/semantics/article |
Rights: | © Vietnam Academy of Science and Technology (VAST) and Springer Nature Singapore Pte Ltd. 2018 |
Peer Review: | si |
Publisher version: | https://doi.org/10.1007/s10013-018-0275-1 |
Appears in Collections: | INV - LOPT - Artículos de Revistas |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2018_Goberna_etal_VietnamJMath_final.pdf | Versión final (acceso restringido) | 346,47 kB | Adobe PDF | Open Request a copy |
2018_Goberna_etal_VietnamJMath_preprint.pdf | Preprint (acceso abierto) | 1,03 MB | Adobe PDF | Open Preview |
Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.