Asymptotic properties of the Fenchel dual functional and applications to decomposition problems

DOI10.1007/BF00940050zbMath0794.49026OpenAlexW1983094140MaRDI QIDQ1321191

Alfred Auslender

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

zbMATH Keywords

decomposition methodsconvex analysisdual functionalsdual sequence of subgradients

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Decomposition methods (49M27)

Related Items

How to deal with the unbounded in optimization: Theory and algorithms, On the convergence of a modified version of SVM^lightalgorithm, Image completion and blind deconvolution: model and algorithm, Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees, Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization, Some convergence results on the regularized alternating least-squares method for tensor decomposition, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, Proximal alternating linearized minimization for nonconvex and 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, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis, Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data, A new nonconvex approach to low-rank matrix completion with application to image inpainting, Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, A new alternating direction method for linearly constrained nonconvex optimization problems, A convergent decomposition algorithm for support vector machines, A block coordinate variable metric forward-backward algorithm, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, 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, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, About saddle values of a class of convex-concave functions

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