Minimizing Certain Convex Functions
From MaRDI portal
Cited in
(28)- Overlapping domain decomposition methods for total variation denoising
- A projective method for structured nonlinear programs
- A generic coordinate descent solver for non-smooth convex optimisation
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- A knowledge-supported improvement of the PSO method
- Regularized multitask learning for multidimensional log-density gradient estimation
- Randomized Block Adaptive Linear System Solvers
- A note on quasi convex programming
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- A survey of numerical algorithms that can solve the Lasso problems
- Domain decomposition for non-smooth (in particular TV) minimization
- Optimal \(\mathcal{H}_2\) output-feedback control of sampled-data systems
- Coordinate-update algorithms can efficiently detect infeasible optimization problems
- Method of cyclic descent in the problem of best approximation
- A stochastic subspace approach to gradient-free optimization in high dimensions
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Über die Konvergenz von Einzelschrittverfahren zur Minimierung konvexer Funktionen. (On convergence of one-step methods for minimizing convex functions.)
- scientific article; zbMATH DE number 7409363 (Why is no real title available?)
- Block coordinate Dinkelbach algorithms for solving block-structured constrained fractional optimization problems
- A convergent overlapping domain decomposition method for total variation minimization
- Majorization minimization by coordinate descent for concave penalized generalized linear models
- Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems
- Nonlinear successive over-relaxation
- On global convergence of alternating least squares for tensor approximation
- The blockwise coordinate descent method for integer programs
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Approximation methods for the unconstrained optimization
This page was built for publication: Minimizing Certain Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5335465)
