Dual coordinate ascent methods for non-strictly convex minimization
From MaRDI portal
Publication:2368079
A special problem of convex programming possessing a certain separable structure is considered. The suggested method for solving this problem appears to be a dual version of a block coordinate ascent method. The convergence for this dual method is proved. It is shown that Han's method for the minimization of a strictly convex quadratic function on the intersection of a collection of closed convex sets and the method of multipliers for the problem of convex programming with linear constraints are special cases of the suggested method.
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
Cites work
- A Decomposition Method and Its Application to Convex Programming
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A successive projection method
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Multiplier and gradient methods
- Optimization of “\log x” Entropy over Linear Equality Constraints
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Relaxation methods for problems with strictly convex separable costs and linear constraints
Cited in
(36)- Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients
- On the dual coordinate ascent approach for nonlinear networks
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- A parallel descent algorithm for convex programming
- Improving ADMMs for solving doubly nonnegative programs through dual factorization
- A single image dehazing model using total variation and inter-channel correlation
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Parallel variable distribution algorithm for constrained optimization with nonmonotone technique
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Computational acceleration of projection algorithms for the linear best approximation problem
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- Dykstras algorithm with bregman projections: A convergence proof
- Block coordinate descent methods for semidefinite programming
- An efficient inexact ABCD method for least squares semidefinite programming
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- THE LINEAR TIME FREQUENCY ANALYSIS TOOLBOX
- scientific article; zbMATH DE number 3887457 (Why is no real title available?)
- Penalized Orthogonal Iteration for Sparse Estimation of Generalized Eigenvalue Problem
- Decomposition methods for sparse matrix nearness problems
- CONVERGENCE PROOF OF COORDINATEWISE MINIMIZATION ALGORITHM FOR CONVEX PROGRAMMING PROBLEM WITH UPPER AND LOWER BOUNDED CONSTRAINTS
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Regularized optimal transport and the rot mover's distance
- On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization
- Coordinate Descent Face-Off: Primal or Dual?
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- A sequential dual method for the structured ramp loss minimization
- Relative rearrangement method for estimating dual norms
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Sparse additive models in high dimensions with wavelets
- Graph-structured tensor optimization for nonlinear density control and mean field games
- Variable Selection and Basis Learning for Ordinal Classification
- Heavy Lasso: sparse penalized regression under heavy-tailed noise via data-augmented soft-thresholding
- Adaptive sieving: a dimension reduction technique for sparse optimization problems
- Additive-effect assisted learning
- A coordinate gradient descent method for nonsmooth separable minimization
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)
