Results 111 to 120 of about 2,178 (210)

Convergence of a Simple Subgradient Level Method

open access: yes, 1998
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  

Properties and Application of Incomplete Orthogonalization in the Directions of Gradient Difference in Optimization Methods

open access: yesMathematics
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

Two “Well-Known” Properties of Subgradient Optimization

open access: yes, 2006
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

open access: yes, 1991
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  

Modified Spectral Projected Subgradient Method: Convergence Analysis and Momentum Parameter Heuristics

open access: yesBulletin of Computational Applied Mathematics, 2016
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  

Aplikasi metoda subgradient untuk menyelesaikan program linear fuzzy=Applied subgradient methods for solving fuzzy linear programming

open access: yes, 2005
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  

Home - About - Disclaimer - Privacy