The following pages link to Coordinate descent algorithms (Q2349114):
Displaying 50 items.
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex (Q510299) (← links)
- Random reordering in SOR-type methods (Q522242) (← links)
- Off-diagonal symmetric nonnegative matrix factorization (Q820738) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- Weighted rank estimation for nonparametric transformation models with nonignorable missing data (Q830580) (← links)
- Inference for time-varying signals using locally stationary processes (Q1631413) (← links)
- Simultaneous reconstruction and segmentation with the Mumford-Shah functional for electron tomography (Q1631539) (← links)
- Visualizing the effects of a changing distance on data using continuous embeddings (Q1658724) (← links)
- Optimal designs for dose-response models with linear effects of covariates (Q1663125) (← links)
- A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems (Q1679841) (← links)
- Cost-to-travel functions: a new perspective on optimal and model predictive control (Q1680654) (← links)
- Adaptive block coordinate DIRECT algorithm (Q1685578) (← links)
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes (Q1711086) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- Developing integer calibration weights for census of agriculture (Q1722623) (← links)
- A distributed asynchronous method of multipliers for constrained nonconvex optimization (Q1737831) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Optimized packing multidimensional hyperspheres: a unified approach (Q1979535) (← links)
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization (Q1983931) (← links)
- Block coordinate descent energy minimization for dynamic cohesive fracture (Q1988165) (← links)
- A geometric probability randomized Kaczmarz method for large scale linear systems (Q1995943) (← links)
- Mixed-level column augmented uniform designs (Q2001206) (← links)
- On shortest Dubins path via a circular boundary (Q2003843) (← links)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods (Q2023684) (← links)
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures (Q2027970) (← links)
- Quadratically regularized optimal transport (Q2041024) (← links)
- A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Imputation of clinical covariates in time series (Q2051236) (← links)
- Maximum likelihood estimation for non-minimum-phase noise transfer function with Gaussian mixture noise distribution (Q2059327) (← links)
- Local search with groups of step sizes (Q2060555) (← links)
- Gauss-Seidel method with oblique direction (Q2063282) (← links)
- Linear support vector regression with linear constraints (Q2071335) (← links)
- Two-level monotonic multistage recommender systems (Q2074300) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms (Q2082232) (← links)
- Risk-averse policy optimization via risk-neutral policy optimization (Q2082514) (← links)
- Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- High-performance statistical computing in the computing environments of the 2020s (Q2092893) (← links)
- On the convergence of a block-coordinate incremental gradient method (Q2100401) (← links)
- Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022) (← links)
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
- On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces (Q2115326) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training (Q2132578) (← links)
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
