Pages that link to "Item:Q2368079"

The following pages link to Dual coordinate ascent methods for non-strictly convex minimization (Q2368079):

Displaying 30 items.

• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients (Q1032124) (← links)
• On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
• A parallel descent algorithm for convex programming (Q1908925) (← links)
• Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
• A single image dehazing model using total variation and inter-channel correlation (Q2308515) (← links)
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
• Parallel variable distribution algorithm for constrained optimization with nonmonotone technique (Q2375484) (← links)
• Paved with good intentions: analysis of a randomized block Kaczmarz method (Q2437339) (← links)
• Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
• Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
• Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
• An efficient inexact ABCD method for least squares semidefinite programming (Q2805705) (← links)
• THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX (Q3164776) (← links)
• (Q3220105) (← links)
• Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem (Q3391278) (← links)
• Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
• CONVERGENCE PROOF OF COORDINATEWISE MINIMIZATION ALGORITHM FOR CONVEX PROGRAMMING PROBLEM WITH UPPER AND LOWER BOUNDED CONSTRAINTS (Q3760298) (← links)
• Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q3986751) (← links)
• (Q4558156) (← links)
• On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
• Coordinate Descent Face-Off: Primal or Dual? (Q4617605) (← links)
• Relative rearrangement method for estimating dual norms (Q5325388) (← links)
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization (Q5962715) (← links)
• Sparse additive models in high dimensions with wavelets (Q6196795) (← links)
• Graph-structured tensor optimization for nonlinear density control and mean field games (Q6576864) (← links)