pith. sign in

arxiv: 1105.2632 · v1 · pith:LCPTVYK4new · submitted 2011-05-13 · 🧮 math.OC

A splitting proximal point method for Nash-Cournot equilibrium models involving nonconvex cost functions

classification 🧮 math.OC
keywords equilibriumpointlocalmethodnash-cournotnonconvexalgorithmconvergence
0
0 comments X
read the original abstract

Unlike convex case, a local equilibrium point of a nonconvex Nash-Cournot oligopolistic equilibrium problem may not be a global one. Finding such a local equilibrium point or even a stationary point of this problem is not an easy task. This paper deals with a numerical method for Nash-Cournot equilibrium models involving nonconvex cost functions. We develop a local method to compute a stationary point of this class of problems. The convergence of the algorithm is proved and its complexity is estimated under certain assumptions. Numerical examples are implemented to illustrate the convergence behavior of the proposed algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Weighted Spectral Quantum Fidelity

    math.FA 2026-05 unverdicted novelty 6.0

    Defines weighted spectral fidelity F_t^spec(ρ,σ) = Tr[ρ (ρ^{-1} ♯ σ)^{2t}] for t in [0,1], establishes unitary invariance, multiplicativity, concavity in each variable, and violations of DPI away from t=1/2.