Numerical optimization with computational errors

DOI10.1007/978-3-319-30921-7zbMATH Open1347.65112OpenAlexW2388379118MaRDI QIDQ266291FDOQ266291

Authors: Alexander J. Zaslavski 

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

Recommendations

• Convex optimization with computational errors
• The projected subgradient algorithm in convex optimization
• Optimization in Banach spaces
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

zbMATH Keywords

monographconvex optimizationalgorithmHilbert spacemetric spacesmaximal monotone operatorsnumerical optimizationvariational inequalitiescontinuous subgradient methodextragradient methodgradient algorithmmirror descent algorithmNewton's methodnonsmooth problemspenalty methodspresence of computational errorsprojected subgradient methodproximal point algorithmproximal point methodWeiszfeld's method

Mathematics Subject Classification ID

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

Cited In (13)

• Totally relaxed, self-adaptive algorithm for solving variational inequalities over the intersection of sub-level sets
• On the convergence of inertial two-subgradient extragradient method for variational inequality problems
• Two generalized strong convergence algorithms for variational inequality problems in Banach spaces
• The projected subgradient algorithm in convex optimization
• Descent methods with computational errors in Banach spaces
• Optimization in Banach spaces
• Fixed Point and Convergence Results for Nonexpansive Set-Valued Mappings
• Convex optimization with computational errors
• Optimization on solution sets of common fixed point problems
• Stability of the asymptotic behavior for continuous descent methods with a convex objective function
• Directional Pareto efficiency: concepts and optimality conditions
• On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions
• Two iterative processes generated by regular vector fields in Banach spaces

This page was built for publication: Numerical optimization with computational errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266291)