Results 81 to 90 of about 1,615 (176)

Subgradient methods for huge-scale optimization problems

, 2012
We consider a new class of huge-scale problems, the problems with sparse subgradients. The most important functions of this type are piece-wise linear. For optimization problems with uniform sparsity of corresponding linear operators, we suggest a very ...
Nesterov, Yurii
core   +1 more source

Newtonian Property of Subgradient Method with Optimization of Metric Matrix Parameter Correction

Mathematics
The work proves that under conditions of instability of the second derivatives of the function in the minimization region, the estimate of the convergence rate of Newton’s method is determined by the parameters of the irreducible part of the ...
Elena Tovbis, Vladimir Krutikov, Lev Kazakovtsev   +2 more
doaj   +1 more source

First-order methods of smooth convex optimization with inexact oracle [PDF]

In this paper, we analyze different first-order methods of smooth convex optimization employing inexact first-order information. We introduce the notion of an approximate first-order oracle.
GLINEUR, François, NESTEROV, Yurii, DEVOLDER, Olivier   +2 more
core  

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

, 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  

Inexact proximal ϵ -subgradient methods for composite convex optimization problems

, 2019
Inexact proximal ϵ -subgradient methods for composite convex optimization ...
MP Machado (15806216), RD Millán (15806213)   +1 more
core  

The Efficiency of subgradient projection methods for convex nondifferentiable optimization

, 1993
We study subgradient methods for convex optimization that use projections onto successive approximations of level sets of the objective corresponding to estimates of the optimal value. We show that they enjoy almost optimal efficiency estimates.
Kiwiel, Krzysztof C.
core   +1 more source

Primal-dual subgradient methods for convex problems

, 2005
In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an ...
Nesterov, Yurii, Yurii Nesterov
core   +1 more source

Relay Selection and Subcarrier-Pair Based Energy-Efficient Resource Allocation for Multirelay Cooperative OFDMA Networks

International Journal of Antennas and Propagation, 2014
Energy-efficient resource allocation is investigated for a relay-based multiuser cooperation orthogonal frequency division multiple access (OFDMA) uplink system with amplify-and-forward (AF) protocol for all relays. The objective is to maximize the total
Wanming Hao, Shouyi Yang, Wanliang Hao
doaj   +1 more source

Primal-dual subgradient methods for convex problems

, 2009
In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primal-dual since they are always able to generate a feasible approximation to the optimum of an
Nesterov, Yurii
core   +1 more source

Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization

, 2023
We consider (stochastic) subgradient methods for strongly convex but potentially nonsmooth non-Lipschitz optimization. We provide new equivalent dual descriptions (in the style of dual averaging) for the classic subgradient method, the proximal ...
Grimmer, Benjamin, Li, Danlin
core