Results 71 to 80 of about 884 (184)

Inertial subgradient-type algorithm for solving equilibrium problems with strong monotonicity over fixed point sets

Journal of Inequalities and Applications
This paper introduces an inertial subgradient-type algorithm for solving equilibrium problems with strong monotonicity, constrained over the fixed point set of a nonexpansive mapping in the framework of a real Hilbert space.
Manatchanok Khonchaliew, Narin Petrot
doaj   +1 more source

An Extension of Subgradient Method for Variational Inequality Problems in Hilbert Space

Abstract and Applied Analysis, 2013
An extension of subgradient method for solving variational inequality problems is presented. A new iterative process, which relates to the fixed point of a nonexpansive mapping and the current iterative point, is generated.
Xueyong Wang, Shengjie Li, Xipeng Kou
doaj   +1 more source

Incremental Weak Subgradient Methods for Non-Smooth Non-Convex Optimization Problems

Information
Non-smooth, non-convex optimization problems frequently arise in modern machine learning applications, yet solving them efficiently remains a challenge.
Narges Araboljadidi, Valentina De Simone
doaj   +1 more source

A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem

EURO Journal on Computational Optimization
We introduce a heuristic rule for calculating the stepsize in the subgradient method for unconstrained convex nonsmooth optimization which, unlike the classic approach, is based on retaining some information from previous iteration.
F. Carrabs, M. Gaudioso, G. Miglionico
doaj   +1 more source

Subgradient projection algorithm, II

Journal of Approximation Theory, 1984
The method presented by the author in Part I [ibid. 35, 111-126 (1982; Zbl 0486.65042)] for the minimization of certain nondifferentiable functions constrained to a convex polytope is extended to the minimization of a strictly convex piecewise smooth function subject to smooth convex constraints.
openaire   +1 more source

An Interior Projected-Like Subgradient Method for Mixed Variational Inequalities

Journal of Applied Mathematics, 2014
An interior projected-like subgradient method for mixed variational inequalities is proposed in finite dimensional spaces, which is based on using non-Euclidean projection-like operator. Under suitable assumptions, we prove that the sequence generated by
Guo-ji Tang, Xing Wang
doaj   +1 more source

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

Bulletin 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, Samantha Clapp, Charles Cratty, Breeanna Page   +3 more
doaj  

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
Abdellatif Moudafi
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