The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
From MaRDI portal
Publication:463005
DOI10.1007/s10957-013-0491-5zbMath1312.90058OpenAlexW2084786453MaRDI QIDQ463005
Publication date: 23 October 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0491-5
Related Items
A method of bi-coordinate variations with tolerances and its convergence, Selective bi-coordinate variations for resource allocation type problems, Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, Random block coordinate descent methods for linearly constrained optimization over networks, Selective bi-coordinate method for limit non-smooth resource allocation type problems, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, Distributed resource allocation on dynamic networks in quadratic time, Primal and dual predicted decrease approximation methods, A Coordinate Wise Variational Method with Tolerance Functions, A decomposition method for Lasso problems with zero-sum constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A convergent decomposition method for box-constrained optimization problems
- A coordinate gradient descent method for nonsmooth separable minimization
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On the convergence of the coordinate descent method for convex differentiable minimization
- Evolution towards the maximum clique
- Polynomial-time decomposition algorithms for support vector machines
- Introductory lectures on convex optimization. A basic course.
- Solution methodologies for the smallest enclosing circle problem
- On the convergence of inexact block coordinate descent methods for constrained optimization
- A convergent decomposition algorithm for support vector machines
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Globally convergent block-coordinate techniques for unconstrained optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- On the convergence of a modified version of SVMlightalgorithm
- Gradient projection methods for quadratic programs and applications in training support vector machines
- On the Convergence of Block Coordinate Descent Type Methods
- On search directions for minimization algorithms
- On the convergence of sequential minimization algorithms
- On the convergence of sequential minimization algorithms
- Convergence of a generalized SMO algorithm for SVM classifier design
