Pages that link to "Item:Q4391290"

The following pages link to Ergodic convergence in subgradient optimization (Q4391290):

Displaying 10 items.

• Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
• Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
• A Lagrangian relaxation approach to large-scale flow interception problems (Q1026763) (← links)
• Subgradient methods for saddle-point problems (Q1035898) (← links)
• On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
• An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration (Q1945380) (← links)
• Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← links)
• A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
• Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
• A merit function approach to the subgradient method with averaging (Q5459823) (← links)