Sufficient conditions for the unsolvability and solvability of the absolute value equation (Q1676495): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: NP-completeness of the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complementarity problems solvable by A single linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute value equation solution via concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute value programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Newton method for absolute value equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack feasibility as an absolute value equation solvable by successive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual bilinear programming solution of the absolute value equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsupervised classification via convex absolute value inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute value equations / rank
 
Normal rank

Revision as of 16:28, 14 July 2024

scientific article
Language Label Description Also known as
English
Sufficient conditions for the unsolvability and solvability of the absolute value equation
scientific article

    Statements

    Identifiers