0460326 20240103212338.720160625235959.9 84961209711 000374781100012 10.1080/10556788.2016.1146267 23 s. P cav_un_epca*02545881055-6788313 (2016)622-644Taylor & Francis bound-constrained optimization multigrid methods linear complementarity problems cav_un_auth*0101131 Matematická teorie rozhodování Department of Decision Making Theory MTR MTR Department of Decision Making Theory 50 Kočvara Michal UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0333149 50 Mohammed S. GB http://library.utia.cas.cz/separaty/2016/MTR/kocvara-0460326.pdf cav_un_auth*0289475 GAP201/12/0671 GA ČR CZ cav_un_auth*0331291 313781 European Commission - EC XE The aim of this paper is to design an efficient multigrid method for constrained convex optimization problems arising from discretization of some underlying infinite dimensional problems. Due to problem dependency of this approach, we only consider bound constraints with (possibly) a single equality constraint. As our aim is to target large-scale problems, we want to avoid computation of second derivatives of the objective function, thus excluding Newton like methods. We propose a smoothing operator that only uses first-order information and study the computational efficiency of the resulting method. BA 2017 2 RVO:67985556 http://hdl.handle.net/11104/0261898 S 3+4 Article Computer Science Software Engineering|Operations Research Management Science|Mathematics Applied MATHEMATICS.APPLIED|OPERATIONSRESEARCH&MANAGEMENTSCIENCE|COMPUTERSCIENCE.SOFTWAREENGINEERING 1.734 0.123 8.6 0.00464 1.06 1514 0.870 Q1 0.932 65 Q2 79.863 38.9 Q1 Q2 58.627 2016 84961209711 SCOPUS 000374781100012 WOS cav_un_epca*0254588 Optimization Methods & Software 1055-6788 1029-4937 Roč. 31 č. 3 2016 622 644 Taylor & Francis