Title
Řešení úloh matematického programování s nepřesným řešením pomocných problémů
Code
GA201/97/0421
Summary
Quadratic programming problems arise naturally in the solution of many practical problems. The point of the research program that we propose here is to get results that would improve of the relations between the precision of the solution of auxiliary pro blems in quadratic programming algorithms of the Polyak and augmented Lagrangian type, to suggest some new strategies, to substantiate them theoretically and to carry out some numerical experiments. The proposed research program concerns the algorithms
Start year
1997
End year
1999
Provider
Grantová agentura ČR
Category
Obecná forma
Type
Standardní projekty
Solver
Information system of research, development and innovation (in Czech)