Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation

Ladislav Lukšan

Kybernetika (1984)

  • Volume: 20, Issue: 6, page 445-457
  • ISSN: 0023-5954

How to cite

top

Lukšan, Ladislav. "Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation." Kybernetika 20.6 (1984): 445-457. <http://eudml.org/doc/27758>.

@article{Lukšan1984,
author = {Lukšan, Ladislav},
journal = {Kybernetika},
keywords = {dual methods; linearly constrained nonlinear minimax approximation; algorithm; convergence},
language = {eng},
number = {6},
pages = {445-457},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation},
url = {http://eudml.org/doc/27758},
volume = {20},
year = {1984},
}

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
PB - Institute of Information Theory and Automation AS CR
VL - 20
IS - 6
SP - 445
EP - 457
LA - eng
KW - dual methods; linearly constrained nonlinear minimax approximation; algorithm; convergence
UR - http://eudml.org/doc/27758
ER -

References

top
  1. M. S. Bazaraa, C. M. Shetty, Nonlinear Programming - Theory and Algorithms, Wiley, New York 1979. (1979) Zbl0476.90035MR0533477
  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. (1969) MR0290799
  3. S. P. Han, Variable metric methods for minimizing a class of nondifferentiable functions, Math. Programming 20 (1981), 1, 1-13. (1981) Zbl0441.90095MR0594019
  4. L. Lukšan, Variable metric methods for linearly constrained nonlinear minimax approximation, Computing 30 (1983), 3, 315-334. (1983) MR0706672
  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. (1978) Zbl0375.65034MR0472055
  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. (1977) MR0483447
  8. P. Wolfe, Finding the nearest point in a polytope, Math. Programming 11 (1976), 2, 128- 149. (1976) Zbl0352.90046MR0452683
  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). (1985) MR0788667

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.