Solving the semismooth equivalence problem

DOI10.1016/J.EJOR.2003.05.003zbMath1106.90067OpenAlexW1988674450MaRDI QIDQ1877021

Stefan Pickl

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.05.003

zbMATH Keywords

Newton methodsIndex-setsMax-type functionsSemismooth system

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Cooperative games (91A12) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites Work

• Unnamed Item
• Convex games and feasible sets in control theory
• Newton methods for solving nonsmooth equations via a new subdifferential
• Generalized Newton and NCP- methods: convergence, regularity, actions
• Game Theory and Cost Allocation Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems

This page was built for publication: Solving the semismooth equivalence problem