Results 91 to 100 of about 19,030 (190)

A subgradient projection method for quasiconvex minimization

Positivity
Abstract In this paper, a subgradient projection method for quasiconvex minimization problems is provided. By using strong subdifferentials, it is proved that the generated sequence of the proposed algorithm converges to the solution of the minimization problem of a proper, lower semicontinuous and strongly quasiconvex function (in the sense of
Juan Choque, Felipe Lara, Raúl T. Marcavillaca   +2 more
openaire   +2 more sources

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

Horoballs and the subgradient method

To explore convex optimization on Hadamard spaces, we consider an iteration in the style of a subgradient algorithm. Traditionally, such methods assume that the underlying spaces are manifolds and that the objectives are geodesically convex: the methods are described using tangent spaces and exponential maps.
Lewis, Adrian S., Lopez-Acedo, Genaro, Nicolae, Adriana   +2 more
openaire   +2 more sources

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

A golden ratio technique for equilibrium problem in reflexive Banach spaces

Demonstratio Mathematica
In this article, we present a self-adaptive subgradient extragradient method for approximating solutions of equilibrium problems with pseudomonotone and Lipschitz type bifunctions in the context of reflexive Banach spaces.
Abass Hammed A., Adamu Abubakar, Oyewole Olawale K., Aphane Maggie   +3 more
doaj   +1 more source

Diagnosis of Alzheimer's Disease Based on Accelerated Mirror Descent Optimization and a Three-Dimensional Aggregated Residual Network. [PDF]

Sensors (Basel), 2023
Tu Y, Lin S, Qiao J, Zhang P, Hao K.
europepmc   +1 more source

Control learning rate for autism facial detection via deep transfer learning. [PDF]

Signal Image Video Process, 2023
El Mouatasim A, Ikermane M.
europepmc   +1 more source

Subgradient Langevin Methods for Sampling from Nonsmooth Potentials

SIAM Journal on Mathematics of Data Science
This paper is concerned with sampling from probability distributions $π$ on $\mathbb{R}^d$ admitting a density of the form $π(x) \propto e^{-U(x)}$, where $U(x)=F(x)+G(Kx)$ with $K$ being a linear operator and $G$ being non-differentiable. Two different methods are proposed, both employing a subgradient step with respect to $G\circ K$, but, depending ...
Andreas Habring, Martin Holler, Thomas Pock   +2 more
openaire   +3 more sources

About the Subgradient Method for Equilibrium Problems

Mathematics
Convergence results of the subgradient algorithm for equilibrium problems were mainly obtained using a Lipschitz continuity assumption on the given bifunctions. In this paper, we first provide a complexity result for monotone equilibrium problems without assuming Lipschitz continuity.
openaire   +3 more sources

Surrogate "Level-Based" Lagrangian Relaxation for mixed-integer linear programming. [PDF]

Sci Rep, 2022
Bragin MA, Tucker EL.
europepmc   +1 more source