Results 111 to 120 of about 2,178 (210)
Convergence of a Simple Subgradient Level Method
We study the subgradient projection method for convex optimization with Brannlund 's level control for estimating the optimal value. We establish global convergence in objective values without additional assumptions employed in the literature.
Krzysztof C. Kiwiel, Jean-louis Goffin
core
This paper considers the problem of unconstrained minimization of smooth functions. Despite the high efficiency of quasi-Newton methods such as BFGS, their performance degrades in ill-conditioned problems with unstable or rapidly varying Hessians—for ...
Vladimir Krutikov +4 more
doaj +1 more source
Letter to the Editor - Update from Ukraine: Development of the Cloud-based Platform for Patient-centered Telerehabilitation of Oncology Patients with Mathematical-related Modeling. [PDF]
Malakhov KS.
europepmc +1 more source
Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
42 pages, 7 ...
Li, Hanyang, Cui, Ying
openaire +2 more sources
Two “Well-Known” Properties of Subgradient Optimization
The subgradient method is both a heavily employed and widely studied algorithm for non-differentiable optimization. Nevertheless, there are some basic properties of subgradient optimization that, while “well known” to specialists, seem to be rather ...
Anstreicher, Kurt, Wolsey, Laurence
core +1 more source
VARIABLE TARGET VALUE SUBGRADIENT METHOD
Polyak's subgradient algorithm for nondifferentiable optimization problems requires prior knowledge of the optimal value of the objective function to find an optimal solution.
CHO, SC, Kim, Sehun, AHN, HU
core
The Modified Spectral Projected Subgradient (MSPS) was proposed to solve Langrangen Dual Problems, and its convergence was shown when the momentum term was zero. The MSPS uses a momentum term in order to speed up its convergence.
Milagros Loreto +3 more
doaj
Ellenberg Indicator Values Disclose Complex Environmental Filtering Processes in Plant Communities along an Elevational Gradient. [PDF]
Di Biase L +3 more
europepmc +1 more source
In this paper we shall present subgradient method for solving two kinds of fuzzy linear programming problems with linear membership functions, i.e., linear programming with constraint coefficients and linear programming with resources and constraint ...
Perpustakaan UGM, i-lib
core
Hybrid Quantum-Classical Algorithm for Robust Optimization via Stochastic-Gradient Online Learning. [PDF]
Lim D, Doriguello JF, Rebentrost P.
europepmc +1 more source

