Numerical optimization with computational errors

DOI10.1007/978-3-319-30921-7zbMath1347.65112OpenAlexW2388379118MaRDI QIDQ266291

Zaslavski, Alexander J.

Publication date: 13 April 2016

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30921-7

zbMATH Keywords

monographalgorithmmaximal monotone operatorsvariational inequalitiesconvex optimizationNewton's methodmetric spacesHilbert spacenumerical optimizationextragradient methodpenalty methodsproximal point algorithmcontinuous subgradient methodgradient algorithmmirror descent algorithmnonsmooth problemspresence of computational errorsprojected subgradient methodproximal point methodWeiszfeld's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Variational inequalities (49J40) Programming in abstract spaces (90C48) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for variational inequalities and related problems (65K15)

Related Items

Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings ⋮ Totally relaxed, self-adaptive algorithm for solving variational inequalities over the intersection of sub-level sets ⋮ Two iterative processes generated by regular vector fields in Banach spaces ⋮ On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions ⋮ On the convergence of inertial two-subgradient extragradient method for variational inequality problems ⋮ Descent methods with computational errors in Banach spaces ⋮ Directional Pareto efficiency: concepts and optimality conditions