Pages that link to "Item:Q5335465"
From MaRDI portal
The following pages link to Minimizing Certain Convex Functions (Q5335465):
Displayed 13 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 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)
- A knowledge‐supported improvement of the PSO method (Q2842720) (← links)
- Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466) (← links)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
- A projective method for structured nonlinear programs (Q5668258) (← links)