Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
From MaRDI portal
Publication:2545648
DOI10.1007/BF01397082zbMath0215.27504OpenAlexW1972989094MaRDI QIDQ2545648
Publication date: 1971
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132104
Related Items (14)
Unnamed Item ⋮ On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems ⋮ Convergence of relaxation algorithms by averaging ⋮ Two parallel distribution algorithms for convex constrained minimization problems ⋮ Proximal alternating linearized minimization for nonconvex and nonsmooth problems ⋮ A Bayesian-variational cyclic method for solving estimation problems characterized by non-uniqueness (equifinality) ⋮ Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ Convergence properties of relaxation algorithms ⋮ Minimization methods with constraints ⋮ Approximation methods for the unconstrained optimization ⋮ Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping ⋮ Sur des méthodes d'optimisation par relaxation ⋮ Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
Cites Work
This page was built for publication: Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
