Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme (Q2070401): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q933790
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Maria J. Cánovas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11228-021-00597-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3192097218 / rank
 
Normal rank

Latest revision as of 03:34, 20 March 2024

scientific article
Language Label Description Also known as
English
Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme
scientific article

    Statements

    Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme (English)
    0 references
    0 references
    0 references
    0 references
    24 January 2022
    0 references
    The paper deals with the parametrized set of solutions of linear inequality systems in \(\mathbb{R}^n\) of the form \[ F(b) = \{x \in \mathbb{R}^n \mid Ax \leq q + Pb \}, \] where \(A \in \mathbb{R}^{m \times n}\), \(P \in \mathbb{R}^{m \times k}\), \(x \in \mathbb{R}^n\) is the decision variable. The authors introduce the concept of calmness of a parametrized mapping at a fixed parameter in its neighbourhood. The main goal of the paper is to study calmness properties of the feasible set mapping \(F(b)\). In the further part of the paper, relations between the calmness behaviour of the parametrized problem and the speed of convergence of the path-following method are studied. Theoretical results are accompanied with illustrative examples.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    calmness
    0 references
    linear systems of equalities and inequalities
    0 references
    primal-dual path-following algorithm
    0 references
    linear programming
    0 references
    feasible set mapping
    0 references
    0 references