Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Quadratic programming

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The SUBQ method in quadratic programming

100%

Hille G.

Mathematica Applicanda

1980

tom 8

nr 16

Author's summary: "In linear programming the simple upper bound method (SUB in short) is well known. It is a modification of the simplex method which finds a minimum of the target function on an admissible set with some additional conditions of the form β≤x≤α imposed on x. "In this paper we present a method which solves the problem of minimization of a quadratic, convex target function on an admissible set defined by conditions of the form β≤x≤α. It is a modification of the C. E. Lemke algorithm [Management Sci. 8 (1961/62), 442–453; MR0148483] for problems of quadratic programming. Because of the special form of the conditions defining the admissible set this method is in a sense a counterpart of the SUB method in linear programming. Therefore we call the algorithm the SUBQ algorithm (the simple upper bound algorithm for quadratic programming). "In Section 2 we give a description of the method based mainly on a geometric interpretation. In Section 3 we present the algorithm and in Section 4 we give a proof of the convergence of the method.''

A numerically stable least squares solution to the quadratic programming problem

44%

Übi E.

Open Mathematics

2008

tom 6

nr 1

171-178

The strictly convex quadratic programming problem is transformed to the least distance problem - finding the solution of minimum norm to the system of linear inequalities. This problem is equivalent to the linear least squares problem on the positive orthant. It is solved using orthogonal transformations, which are memorized as products. Like in the revised simplex method, an auxiliary matrix is used for computations. Compared to the modified-simplex type methods, the presented dual algorithm QPLS requires less storage and solves ill-conditioned problems more precisely. The algorithm is illustrated by some difficult problems.

Ograniczanie wyników

1 Mathematica Applicanda

1 Open Mathematics

1 Hille G.

1 Übi E.

1 2008

1 1980

Wyniki wyszukiwania

The SUBQ method in quadratic programming

A numerically stable least squares solution to the quadratic programming problem