zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Convergence of an adaptive penalty scheme for finding constrained equilibria. (English) Zbl 0773.90092

Summary: This note is devoted to establishing the convergence of a certain penalty scheme for solving monotonic constrained equilibrium problems via a sequence of penalized, but less constrained, subproblems. The penalty parameter, t, is steered adaptively and tends to a limiting value t * (0,+), which prevents the subproblems from becoming unstable in the limit. The method is similar to the one of the first author [U.S.S.R. Comput. Math. Math. Phys. 26, No. 6, 117-122 (1986; Zbl 0635.90073)] and the authors [Numer. Funct. Anal. Optimization 10, No. 9/10, 1003-1017 (1989; Zbl 0703.49011)], but is augmented by an interpolatory step. This permits the avoidance of an unpleasant lower semicontinuity requirement for the solution set, S(t), of the penalized subproblems, and moreover permits the estimation of the rate of convergence in the convex case.

Equilibrium problems in the sense used here are considered, under various headings, for instance by J. Gwinner, G. Minty, U. Mosco, the second author and S. Simons, and, without monotonicity by H. Brézis, L. Nirenberg and G. Stampacchia, Ky Fan and J. Gwinner. Adaptive penalty methods of the type considered here do not seem to have been discussed for general equilibrium problems.

MSC:
90C48Programming in abstract spaces
49M30Other numerical methods in calculus of variations
49J45Optimal control problems involving semicontinuity and convergence; relaxation
49J40Variational methods including variational inequalities
91B52Special types of equilibria in economics