Pages that link to "Item:Q5335465"

The following pages link to Minimizing Certain Convex Functions (Q5335465):

Displaying 16 items.

• A convergent overlapping domain decomposition method for total variation minimization (Q711582) (← links)
• Majorization minimization by coordinate descent for concave penalized generalized linear models (Q746337) (← links)
• Nonlinear successive over-relaxation (Q1059370) (← links)
• Method of cyclic descent in the problem of best approximation (Q1155808) (← links)
• Approximation methods for the unconstrained optimization (Q1234630) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
• A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
• The blockwise coordinate descent method for integer programs (Q2189480) (← links)
• A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
• A note on quasi convex programming (Q2527121) (← links)
• Über die Konvergenz von Einzelschrittverfahren zur Minimierung konvexer Funktionen. (On convergence of one-step methods for minimizing convex functions.) (Q2550958) (← links)
• On global convergence of alternating least squares for tensor approximation (Q2696915) (← links)
• A knowledge‐supported improvement of the PSO method (Q2842720) (← links)
• Regularized Multitask Learning for Multidimensional Log-Density Gradient Estimation (Q5380548) (← links)
• Randomized Block Adaptive Linear System Solvers (Q6094749) (← links)