Pages that link to "Item:Q3114576"

The following pages link to A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces (Q3114576):

Displaying 17 items.

• Subgradient algorithms for solving variable inequalities (Q297868) (← links)
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
• Strong convergence in Hilbert spaces via \(\varGamma \)-duality (Q368727) (← links)
• A subgradient-like algorithm for solving vector convex inequalities (Q467438) (← links)
• Level bundle-like algorithms for convex optimization (Q743968) (← links)
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
• A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
• On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
• Modified basic projection methods for a class of equilibrium problems (Q2413497) (← links)
• Approximation of common solutions for system of equilibrium problems and fixed-point problems (Q2512868) (← links)
• On the weak and strong convergence of modified forward-backward-half-forward splitting methods (Q2693799) (← links)
• A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
• On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces (Q2805982) (← links)
• A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy (Q2808300) (← links)
• The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings (Q3422786) (← links)
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)