.png){kind=icon}
返回
Solving the semismooth equivalence problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.05.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
semismooth system
Newton methods
index-sets
max-type functions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Spherical aberration measurement of a microscope objective by use of calibrated spherical particles
PREAI
分享收藏
An Iterative Implementation of the Signal Space Separation Method for Magnetoencephalography Systems with Low Channel Counts.png)
Sensors
OAAI
SensorsIF0
OAAI分享收藏 没有更多内容
没有更多内容