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)
Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems. (English) Zbl 1010.90085

Summary: We develop and analyze a class of trust-region methods for bound-constrained semismooth systems of equations. The algorithm is based on a simply constrained differentiable minimization reformulation. Our global convergence results are developed in a very general setting that allows for nonmonotonicity of the function values at subsequent iterates. We propose a way of computing trial steps by a semismooth Newton-like method that is augmented by a projection onto the feasible set. Under a Dennis-Moré-type condition we prove that close to a regular solution the trust-region algorithm turns into this projected Newton method, which is shown to converge locally q-superlinearly or quadratically, respectively, depending on the quality of the approximate subdifferentials used.

As an important application we discuss how the developed algorithm can be used to solve nonlinear Mixed Complementarity Problems (MCPs). Hereby, the MCP is converted into a bound-constrained semismooth equation by means of an NCP-function. The efficiency of our algorithm is documented by numerical results for a subset of the MCPLIB problem collection.

MSC:
90C33Complementarity and equilibrium problems; variational inequalities (finite dimensions)
90C30Nonlinear programming
49J40Variational methods including variational inequalities
65H10Systems of nonlinear equations (numerical methods)
65K05Mathematical programming (numerical methods)
49M37Methods of nonlinear programming type in calculus of variations
Software:
TRON; QPCOMP; MCPLIB; BPMPD