Decisión multicriterio a través de problemas de optimización cuadrático-fraccionales.
Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation
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.
Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation