New error bounds and their applications to convergence analysis of iterative algorithms
From MaRDI portal
Publication:1584006
DOI10.1007/s101070000173zbMath0965.65090MaRDI QIDQ1584006
Publication date: 2 August 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds ⋮ Stability of minimization problems and the error bound condition ⋮ Error bounds and a condition number for the absolute value equations ⋮ On a solution method in indefinite quadratic programming under linear constraints ⋮ Random algorithms for convex minimization problems ⋮ Linear and nonlinear error bounds for lower semicontinuous functions ⋮ The gradient projection algorithm for a proximally smooth set and a function with Lipschitz continuous gradient ⋮ A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound ⋮ Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound ⋮ Global projection-type error bounds for general variational inequalities ⋮ The gradient projection algorithm for smooth sets and functions in nonconvex case ⋮ A nonmonotone smoothing Newton algorithm for weighted complementarity problem ⋮ Some characterizations of error bound for non-lower semicontinuous functions ⋮ Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems ⋮ Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
This page was built for publication: New error bounds and their applications to convergence analysis of iterative algorithms
