Geodesic
Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation
Applications of Mathematics, Tome 31 (1986) no. 5, pp. 379-395
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

The paper describes the dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation. Two cases are analyzed in detail, differring in linear dependence of gradients of the active functions. The complete algorithm of the dual method is presented and its finite step convergence is proved.
The paper describes the dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation. Two cases are analyzed in detail, differring in linear dependence of gradients of the active functions. The complete algorithm of the dual method is presented and its finite step convergence is proved.
DOI : 10.21136/AM.1986.104215
Classification : 65K05, 90C20
Keywords: nonlinear minimax approximation; method of recursive quadratic programming; dual method; convergence; algorithm 
@article{10_21136_AM_1986_104215,
     author = {Luk\v{s}an, Ladislav},
     title = {Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation},
     journal = {Applications of Mathematics},
     pages = {379--395},
     year = {1986},
     volume = {31},
     number = {5},
     doi = {10.21136/AM.1986.104215},
     mrnumber = {0863033},
     zbl = {0621.65061},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1986.104215/}
}
TY  - JOUR
AU  - Lukšan, Ladislav
TI  - Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation
JO  - Applications of Mathematics
PY  - 1986
SP  - 379
EP  - 395
VL  - 31
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1986.104215/
DO  - 10.21136/AM.1986.104215
LA  - en
ID  - 10_21136_AM_1986_104215
ER  - 
%0 Journal Article
%A Lukšan, Ladislav
%T Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation
%J Applications of Mathematics
%D 1986
%P 379-395
%V 31
%N 5
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1986.104215/
%R 10.21136/AM.1986.104215
%G en
%F 10_21136_AM_1986_104215
Lukšan, Ladislav. Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation. Applications of Mathematics, Tome 31 (1986) no. 5, pp. 379-395. doi: 10.21136/AM.1986.104215

[1] M. S. Bazaraa C. M. Shetty: Nonlinear programming. Theory and algorithms. New York: Wiley 1979. | MR

[2] C. Charalambous J. W. Bandler: Nonlinear minimax optimization as a sequence of least p-th optimization with finite values of p. Faculty Engn., McMaster University, Hamilton, Ontario, Canada, Kept. SOC-3, 1973.

[3] C. Charalambous: Acceleration of the least p-th algorithm for minimax optimization with engineering applications. Math. Programming 17, 270-297, (1979). | DOI | MR

[4] V. F. Demyanov V. N. Malozemov: Introduction to minimax. Chap. 3, § 5. New York: Wiley 1974. | MR

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

[6] D. Goldfarb A. U. Idnani: A numerically stable dual method for solving strictly convex quadratic programs. The City College of New York, Dept. of Computer Sci., Rept. 81- 102, (1981).

[7] J. Hald K. Madsen: Combined LP and Quasi-Newton methods for minimax optimization. Math. Programming 20, 49-62, (1981). | DOI | MR

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

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

[10] K. Madsen: An algorithm for minimax solution of overdetermined systems of nonlinear equations. J. Inst. Math. Appl. 16, 321-328, (1975). | DOI | MR

[11] M. J. D. Powell: A fast algorithm for nonlinearly constrained optimization calculations. In "Numerical analysis, Dundes 1977", (G. A. Watson, ed.), Lecture Notes in Mathematics 630, Berlin: Springer-Verlag 1978. | MR

Cité par Sources :