Results 81 to 90 of about 22,536 (196)
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
Journal of Inequalities and ApplicationsThis 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
Incremental Weak Subgradient Methods for Non-Smooth Non-Convex Optimization Problems
InformationNon-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 simple iterative algorithm for maxcut
, 2019 We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages that all subproblems have explicit analytic solutions, the cut values are ...
Shao, Sihong, Zhang, Dong, Zhang, Weixi
core
EURO Journal on Computational OptimizationWe 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
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
Subgradient Projection Operators
, 2014 Master Thesis Memoir under the supervision of Patrick L.
openaire +2 more sources
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 +3 more
doaj
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
About the Subgradient Method for Equilibrium Problems
MathematicsConvergence 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