A simple adaptive step-size choice for iterative optimization methods
From MaRDI portal
Abstract: We suggest a simple adaptive step-size procedure, which does not require any line-search, for a general class of nonlinear optimization methods and prove convergence of a general method under mild assumptions. In particular, the goal function may be non-smooth and non-convex. Unlike the descent line-search methods, it does not require monotone decrease of the goal function values along the iteration points and reduces the implementation cost of each iteration essentially. The key element of this procedure consists in inserting a majorant step-size sequence such that the next element is taken only if the current iterate does not give a sufficient descent. Its applications yield in particular a new gradient projection method for smooth constrained optimization problems and a new projection type method for minimization of the gap function of a general variational inequality. Preliminary results of computational experiments confirm efficiency of the proposed modification.
Recommendations
Cited in
(8)- An adaptive step size controller for iterative implicit methods
- A non-monotone conjugate subgradient type method for minimization of convex functions
- On some steplength approaches for proximal algorithms
- Penalty method for games of constraints
- A new gradient projection method with self-adaptive step size
- Some new step-size rules for optimization problems
- Self-adaptive algorithms for quasiconvex programming and applications to machine learning
- Dual gradient method with partial regularization for convex optimization problems
This page was built for publication: A simple adaptive step-size choice for iterative optimization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226811)
