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)
Interior proximal and multiplier methods based on second order homogeneous kernels. (English) Zbl 1039.90518
Summary: We study a class of interior proximal algorithms and nonquadratic multiplier methods for solving convex programs, where the usual proximal quadratic term is replaced by a homogeneous functional of order two, defined in terms of a convex function. We prove, under mild assumptions, several new convergence results in both the primal and dual framework, allowing also for approximate minimization. In particular, we introduce a new class of interior proximal methods which is globally convergent and allows for generating C multiplier methods with bounded Hessians which exhibit strong convergence properties. We also consider linearly constrained convex problems and establish global quadratic convergence rates results for linear programs. We then study in detail a particular realization of these algorithms, leading to a new class of logarithmic-quadratic interior point algorithms which are shown to enjoy several attractive properties for solving constrained convex optimization problems.

MSC:
90C25Convex programming
90C51Interior-point methods