Pages that link to "Item:Q1016351"

The following pages link to Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities (Q1016351):

Displaying 30 items.

• Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space (Q452273) (← links)
• An alternating extragradient method with non Euclidean projections for saddle point problems (Q480931) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• Subgradient methods for saddle-point problems (Q1035898) (← links)
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
• Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• A fast dual proximal gradient algorithm for convex minimization and applications (Q1667162) (← links)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• An interior projected-like subgradient method for mixed variational inequalities (Q2336578) (← links)
• Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators (Q2424035) (← links)
• Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
• A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
• Variable metric inexact line-search-based methods for nonsmooth optimization (Q2802142) (← links)
• Scaling techniques for \(\epsilon\)-subgradient methods (Q2817840) (← links)
• Iterative Methods for the Elastography Inverse Problem of Locating Tumors (Q4554325) (← links)
• (Q5054606) (← links)
• Abstract convergence theorem for quasi-convex optimization problems with applications (Q5228820) (← links)
• Asymptotic behavior analysis on multivalued evolution inclusion with projection in Hilbert space (Q5248207) (← links)
• Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
• No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
• Explainable bilevel optimization: an application to the Helsinki Deblur Challenge (Q6169501) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems (Q6561482) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
• Distributed dual averaging algorithm for multi-agent optimization with coupled constraints. (Q6648141) (← links)