Qps - Open Access .click

Results 141 to 150 of about 18,690 (152)

Some of the next articles are maybe not open access.

Jackson's Theorem in Qp Spaces in Polydiscs

Advanced Materials Research, 2014
Jackson's theorem is an important result in the theory of approximation of function. The purpose of this article is to introduce a new kind of Qp spaces in the unit polydiscs. Jackson's approximation theorem is established in Qp spaces.
Xiu Heng Zhao, Ying Wei Chen
openaire +2 more sources

Optimal iterative QP and QPQC algorithms

Annals of Operations Research, 2013
We review our recent results in the development of optimal algorithms for the minimization of a strictly convex quadratic function subject to separable convex inequality constraints and/or linear equality constraints. A unique feature of our algorithms is the theoretically supported bound on the rate of convergence in terms of the bounds on the ...
Lukáš Pospíšil, Zdeněk Dostál
openaire +2 more sources

Sparse LP and QP Solvers

2002
The previous chapter discussed methods for unconstrained optimization. For nonlinear constrained optimization problem, two powerful and commonly used algorithms are Sequential Linear Programming (SLP) and (SQP). Such algorithms solve a Linear Programming (LP) and Quadratic programming (QP) problems at each iteration.
Shubha Pandit, S. A. Soman, S.A. Khaparde +2 more
openaire +2 more sources

THE QP-DYN ALGORITHMS