Geodesic
Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation
Kybernetika, Tome 20 (1984) no. 6, pp. 445-457 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 65K05, 90C20 
@article{KYB_1984_20_6_a2,
     author = {Luk\v{s}an, Ladislav},
     title = {Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation},
     journal = {Kybernetika},
     pages = {445--457},
     year = {1984},
     volume = {20},
     number = {6},
     mrnumber = {777979},
     zbl = {0552.90074},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a2/}
}
TY  - JOUR
AU  - Lukšan, Ladislav
TI  - Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation
JO  - Kybernetika
PY  - 1984
SP  - 445
EP  - 457
VL  - 20
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a2/
LA  - en
ID  - KYB_1984_20_6_a2
ER  - 
%0 Journal Article
%A Lukšan, Ladislav
%T Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation
%J Kybernetika
%D 1984
%P 445-457
%V 20
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a2/
%G en
%F KYB_1984_20_6_a2
Lukšan, Ladislav. Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation. Kybernetika, Tome 20 (1984) no. 6, pp. 445-457. http://geodesic.mathdoc.fr/item/KYB_1984_20_6_a2/

[1] M. S. Bazaraa, C. M. Shetty: Nonlinear Programming - Theory and Algorithms. Wiley, New York 1979. | MR | Zbl

[2] D. Goldfarb: Extension of Davidson's variable metric method to maximization under linear inequality and equality constraints. SIAM J. Appl. Math. 17 (1969), 4, 739-764. | MR

[3] S. P. Han: Variable metric methods for minimizing a class of nondifferentiable functions. Math. Programming 20 (1981), 1, 1-13. | MR | Zbl

[4] L. Lukšan: Variable metric methods for linearly constrained nonlinear minimax approximation. Computing 30 (1983), 3, 315-334. | MR

[5] L. Lukšan: Dual method for solving a special problem of quadratic programming as a sub-problem at nonlinear minimax approximation. Computing (submitted for publication).

[6] K. Madsen, H. Schjaer-Jacobsen: Linearly constrained minimax optimization. Math. Programming 14 (1978), 2, 208-223. | MR | Zbl

[7] M. J. D. Powell: A fast algorithm for nonlinearly constrained optimization calculations. In: Numerical Analysis, Dundee 1977 (Lecture Notes in Mathematics 630, G. A. Watson, ed.). Springer-Verlag, Berlin-Heidelberg-New York 1978. | MR

[8] P. Wolfe: Finding the nearest point in a polytope. Math. Programming 11 (1976), 2, 128- 149. | MR | Zbl

[9] L. Lukšan: An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation. Kybernetika 21 (1985), 1 (to appear). | MR