Treffer: The four-block model matching problem in l1 and infinite-dimensional linear programming

Title:
The four-block model matching problem in l1 and infinite-dimensional linear programming
Authors:
STAFFANS, O. J
Source:
SIAM journal on control and optimization. 31(3):747-779
Publisher Information:
Philadelphia, PA: Society for Industrial and Applied Mathematics, 1993.
Publication Year:
1993
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Automatique théorique. Systèmes, Control theory. Systems, Commande optimale, Optimal control, Ajustement modèle, Model matching, Ajustamiento modelo, Commande optimale, Optimal control, Control optimal, Complexité calcul, Computing complexity, Complejidad cálculo, Convergence, Convergencia, Dimension infinie, Infinite dimension, Dimensión infinita, Dualité, Duality, Dualidad, Méthode domaine fréquence, Frequency domain method, Método dominio frecuencia, Programmation linéaire, Linear programming, Programación lineal, Redondance, Redundancy, Redundancia, l1 optimization
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Helsinki univ. technology, inst. mathematics, SF 02150 Espoo, Finland
ISSN:
0363-0129
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=4709042
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4709042
Database:
PASCAL Archive

Weitere Informationen

The purpose of this work is fourfold. First the reader is introduced to the present state of the theory behind the solution of the general model matching problem inl1. This solution is based on the fact that the model matching problem can be recast as an infinite-dimensional linear programming problem. However, the transformation into linear programming form is highly nonunique, which leads to the second question of discussion, namely, how to find a «good» linear programming formulation. It is shown that the presently available formulations contain some redundancies that limit the applicability of the theory and lead to linear programming systems containing unnecessary degeneracies. The third object of this work is to study problems related to the computational complexity of two different approximation methods for the solution of the infinite-dimensional linear programming systems.