Dual coordinate ascent methods for non-strictly convex minimization

DOI10.1007/BF01581245zbMATH Open0782.90073MaRDI QIDQ2368079FDOQ2368079

Authors: Paul Tseng 

Publication date: 22 August 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Recommendations

• Dual randomized coordinate descent method for solving a class of nonconvex problems
• Duality algorithms for nonconvex variational principles
• On duality bound methods for nonconvex global optimization
• Duality for nonconvex optimization and its applications
• Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
• Duality for nonconvex approximation and optimization.
• Stochastic dual coordinate ascent methods for regularized loss minimization
• On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
• Duality in nonconvex vector optimization
• Duality in nonconvex vector minimum problems

zbMATH Keywords

convergenceseparable programmingdual version of a block coordinate ascent method

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Cites Work

• Title not available (Why is that?)
• Convex Analysis
• Multiplier and gradient methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• A successive projection method
• Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
• Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• A Decomposition Method and Its Application to Convex Programming
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• A new method for the optimization of a nonlinear function subject to nonlinear constraints

Cited In (31)

• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
• Decomposition methods for sparse matrix nearness problems
• Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
• Computational acceleration of projection algorithms for the linear best approximation problem
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization
• Graph-structured tensor optimization for nonlinear density control and mean field games
• Dykstras algorithm with bregman projections: A convergence proof
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX
• Improving ADMMs for solving doubly nonnegative programs through dual factorization
• A parallel descent algorithm for convex programming
• An efficient inexact ABCD method for least squares semidefinite programming
• CONVERGENCE PROOF OF COORDINATEWISE MINIMIZATION ALGORITHM FOR CONVEX PROGRAMMING PROBLEM WITH UPPER AND LOWER BOUNDED CONSTRAINTS
• Title not available (Why is that?)
• Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
• Relative rearrangement method for estimating dual norms
• Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem
• Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
• Sparse additive models in high dimensions with wavelets
• Regularized optimal transport and the rot mover's distance
• Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
• On the dual coordinate ascent approach for nonlinear networks
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• A single image dehazing model using total variation and inter-channel correlation
• A sequential dual method for the structured ramp loss minimization
• Coordinate Descent Face-Off: Primal or Dual?
• A coordinate gradient descent method for nonsmooth separable minimization
• Block coordinate descent methods for semidefinite programming
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems

This page was built for publication: Dual coordinate ascent methods for non-strictly convex minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368079)