Results 171 to 180 of about 19,600 (195)
Some of the next articles are maybe not open access.
On Poljak's improved subgradient method
Journal of Optimization Theory and Applications, 1988\textit{B. T. Polyak} [USSR Comput. Math. Math. Phys. 9 (1969), No.3, 14-29 (1971; Zbl 0229.65056)] has suggested an improved subgradient method and provided a lower bound on the improvement of the Euclidean distance to an optimal solution. In this paper, we provide a stronger lower bound and show that the direction of movement in this method forms a ...
Kim, S. Kim, Sehun, Koh, S.
openaire +3 more sources
A Note on the Convergence of Subgradient Optimization Methods
Mathematische Operationsforschung und Statistik. Series Optimization, 1983The author considers the problem of minimizing a closed proper convex function on \({\mathbb{R}}^ n\) over a closed convex set C. For this purpose the subgradient algorithm can be used. The theoretical convergence of this algorithm and its rate depends essentially on the choice of the step size. The purpose of this note is to present conditions for the
openaire +2 more sources
A Proximal Bundle Method Based on Approximate Subgradients
Computational Optimization and Applications, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Subgradient Extragradient Method with Double Inertial Steps for Variational Inequalities
Journal of Scientific Computing, 2022Yonghong Yao +2 more
exaly
Weak subgradient method for solving nonsmooth nonconvex optimization problems
Optimization, 2021Refail Kasımbeyli, Gulcin Dinç Yalcin
exaly
Subgradient method with feasible inexact projections for constrained convex optimization problems
Optimization, 2022A A Aguiar, O P Ferreira, L F Prudente
exaly
A modified subgradient extragradient method for solving the variational inequality problem
Numerical Algorithms, 2018Qiao-Li Dong, Aviv Gibali
exaly