Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the connectedness of the solution set to linear complementarity systems

From MaRDI portal
Publication:1321481
Jump to:navigation, search

DOI10.1007/BF02207777zbMath0797.90104OpenAlexW2005504993MaRDI QIDQ1321481

Tamás Rapcsák

Publication date: 25 October 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02207777


zbMATH Keywords

sensitivitystabilitylinear complementaritysolution setgeodesic convexityconnecedness


Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)


Related Items (4)

On the connectedness of the solution set to nonlinear complementarity systems ⋮ On the connectedness of solution sets in linear complementarity problems ⋮ Geodesic convexity on Rn1+ ⋮ Connectedness of the solution set of the tensor complementarity problem



Cites Work

  • Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
  • Quadratic programming with M-matrices
  • The complementarity problem
  • A Partition Theorem for Euclidean n-Space
  • Unnamed Item


This page was built for publication: On the connectedness of the solution set to linear complementarity systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1321481&oldid=13437622"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki