Pages that link to "Item:Q1321135"

The following pages link to On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135):

Displaying 50 items.

• Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
• Mid-term bio-economic optimization of multi-species fisheries (Q2307171) (← links)
• Maximum likelihood estimation in Gaussian models under total positivity (Q2313271) (← links)
• Coordinate descent algorithms (Q2349114) (← links)
• On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
• Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
• On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
• Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
• Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization (Q2465768) (← links)
• A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
• New method for solving Ivanov regularization-based support vector machine learning (Q2669598) (← links)
• Manifold optimization for hybrid beamforming in dual-function radar-communication system (Q2688007) (← links)
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
• Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations (Q2797107) (← links)
• Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
• Numerical approximation to ODEs using the error functional (Q2846854) (← links)
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
• Optimal Point Sets for Quasi-Monte Carlo Integration of Bivariate Periodic Functions with Bounded Mixed Derivatives (Q2957045) (← links)
• On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
• Randomized Hessian estimation and directional search (Q2996807) (← links)
• Large-Scale Training of SVMs with Automata Kernels (Q3073616) (← links)
• A DUAL COORDINATE DESCENT ALGORITHM FOR SVMs COMBINED WITH RATIONAL KERNELS (Q3224947) (← links)
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
• Iterative Proportional Scaling Revisited: A Modern Optimization Perspective (Q3391182) (← links)
• The Cyclic Block Conditional Gradient Method for Convex Optimization Problems (Q3449572) (← links)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
• Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
• Rolling-horizon replenishment: Policies and performance analysis (Q3588804) (← links)
• Globally convergent block-coordinate techniques for unconstrained optimization (Q4254662) (← links)
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
• A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
• Nonsmooth Variants of Powell's BFGS Convergence Theorem (Q4641661) (← links)
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
• (Q4969198) (← links)
• Conducting sparse feature selection on arbitrarily long phrases in text corpora with a focus on interpretability (Q4970223) (← links)
• Randomized Gradient Boosting Machine (Q4971024) (← links)
• Sublinear Column-wise Actions of the Matrix Exponential on Social Networks (Q4985793) (← links)
• On Adaptive Sketch-and-Project for Solving Linear Systems (Q4997841) (← links)
• Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem (Q5000631) (← links)
• A non-convex regularization approach for stable estimation of loss development factors (Q5014498) (← links)
• A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems (Q5061750) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• On the Linear Convergence of the Multimarginal Sinkhorn Algorithm (Q5080502) (← links)
• (Q5152646) (← links)
• (Q5155916) (← links)
• Accelerate stochastic subgradient method by leveraging local growth condition (Q5236746) (← links)
• Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
• Computing non-negative tensor factorizations (Q5503698) (← links)