Pages that link to "Item:Q2795104"

The following pages link to A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104):

Displaying 8 items.

• A ranking-based adaptive artificial bee colony algorithm for global numerical optimization (Q778450) (← links)
• Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration (Q2057056) (← links)
• Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
• An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
• Subgradient and sampling algorithms for \(\ell_1\) regression (Q2921678) (← links)
• Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3503200) (← links)
• The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
• On the convergence of broadcast incremental algorithms with applications (Q6612687) (← links)