An almost cyclic 2-coordinate descent method for singly linearly constrained problems
From MaRDI portal
Publication:2419552
DOI10.1007/s10589-019-00082-0zbMath1414.90226arXiv1806.07826OpenAlexW2809196974WikidataQ128326614 ScholiaQ128326614MaRDI QIDQ2419552
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07826
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (4)
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ A Derivative-Free Method for Structured Optimization Problems ⋮ A decomposition method for Lasso problems with zero-sum constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Selective bi-coordinate variations for resource allocation type problems
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Optimal scaling of a gradient method for distributed resource allocation
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Descent methods for convex essentially smooth minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Introductory lectures on convex optimization. A basic course.
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- Solution methodologies for the smallest enclosing circle problem
- Coordinate descent algorithms
- A two-stage active-set algorithm for bound-constrained optimization
- Random block coordinate descent methods for linearly constrained optimization over networks
- A convergent decomposition algorithm for support vector machines
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- On the convergence of a modified version of SVMlightalgorithm
- Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks
- On the Convergence of Block Coordinate Descent Type Methods
This page was built for publication: An almost cyclic 2-coordinate descent method for singly linearly constrained problems
