zbMATH — the first resource for mathematics

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.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
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)
A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. (English) Zbl 0714.90060
The authors present a primal-dual path following algorithm for solving linear and convex quadratic programming problems based on the logarithmic barrier function approach [{\it A. V. Fiacco} and {\it G. P. McCormick}, “Nonlinear programming: sequential unconstrained minimization techniques” (1968; Zbl 0193.188)]. The present algorithm uses power series approximation of the path of solutions for the weighted barrier function family of problems associated with the given programming problem. They study the convergence properties of the algorithm and show that the complexity of the number of iterations depends on the order of approximation, say r. They also discuss the particular cases when $r=1$ and $r\to \infty$ and compare the convergence properties of the algorithm in these particular cases with those of some known polynomial-time primal-dual path following algorithms. No computational results for the algorithm are given.
Reviewer: J.Parida

90C05Linear programming
90C20Quadratic programming
90-08Computational methods (optimization)
90C25Convex programming
90C60Abstract computational complexity for mathematical programming problems
Full Text: DOI