.png){kind=icon}
Return
Solving the semismooth equivalence problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.05.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a special semismooth system of equations and a suitable theoretical and numerical approach for its solution. Exploiting the combinatorial structure of max-type functions and by the introduction of index-sets we can state that a solution can be gained by Newton methods. The problem bases on an economic background which expresses itself in the game-theoretic description of the feasible sets. Especially, for I-convex and quasibalanced games we regard the core as a feasible set and treat a special bargaining solution as a control parameter of a time-discrete system. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
semismooth system
Newton methods
index-sets
max-type functions
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
Spherical aberration measurement of a microscope objective by use of calibrated spherical particles
PREAI
ShareSave
An Iterative Implementation of the Signal Space Separation Method for Magnetoencephalography Systems with Low Channel Counts.png)
Sensors
OAAI
SensorsIF0
OAAIShareSave no more
no more