Pages that link to "Item:Q2349846"

The following pages link to Quasi-monotone subgradient methods for nonsmooth convex minimization (Q2349846):

Displaying 19 items.

• Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
• Algorithms of inertial mirror descent in convex problems of stochastic optimization (Q1641948) (← links)
• Computation of Fisher-Gale equilibrium by auction (Q1656189) (← links)
• Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs (Q1737711) (← links)
• Complexity bounds for primal-dual methods minimizing the model of objective function (Q1785201) (← links)
• Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization (Q2154832) (← links)
• A unitary distributed subgradient method for multi-agent optimization with different coupling sources (Q2174029) (← links)
• Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
• A non-monotone conjugate subgradient type method for minimization of convex functions (Q2302755) (← links)
• Distributed price adjustment based on convex analysis (Q2359783) (← links)
• A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570) (← links)
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
• Algorithmic Principle of Least Revenue for Finding Market Equilibria (Q2957719) (← links)
• (Q4999082) (← links)
• Exact penalties for decomposable convex optimization problems (Q5058390) (← links)
• Discrete Choice Prox-Functions on the Simplex (Q5076710) (← links)
• Solving Large-Scale Optimization Problems with a Convergence Rate Independent of Grid Size (Q5232280) (← links)
• Unifying mirror descent and dual averaging (Q6038659) (← links)
• Regularized quasi-monotone method for stochastic optimization (Q6155646) (← links)