Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
From MaRDI portal
Publication:1321191
DOI10.1007/BF00940050zbMath0794.49026MaRDI QIDQ1321191
Publication date: 15 August 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940050
Related Items
Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, About saddle values of a class of convex-concave functions, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, On the convergence of a modified version of SVMlightalgorithm, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, Linearly-convergent FISTA variant for composite optimization with duality, An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems, Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, A new alternating direction method for linearly constrained nonconvex optimization problems, A block coordinate variable metric forward-backward algorithm, How to deal with the unbounded in optimization: Theory and algorithms, A new nonconvex approach to low-rank matrix completion with application to image inpainting, Some convergence results on the regularized alternating least-squares method for tensor decomposition, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees, Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data, A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction, A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems, A convergent decomposition algorithm for support vector machines, Image completion and blind deconvolution: model and algorithm, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A successive projection method
- Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
- Optimization of “$\log x$” Entropy over Linear Equality Constraints
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- A Parallel Algorithm for a Class of Convex Programs
- Methodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
- Monotone Operators and the Proximal Point Algorithm
- Convex Analysis
