On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
From MaRDI portal
Publication:537652
DOI10.1007/S11590-010-0214-XzbMATH Open1242.90238OpenAlexW2053656372MaRDI QIDQ537652FDOQ537652
Authors: L. Palagi, M. Piacentini, Giampaolo Liuzzi 
Publication date: 20 May 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/wpaper/2010-01.pdf
Recommendations
- On the Convergence of a Regularized Jacobi Algorithm for Convex Optimization
- scientific article; zbMATH DE number 1935541
- On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Convergence results of an approximation method for constrained saddle point problems
- On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
- Publication:4205242
- scientific article; zbMATH DE number 1300180
- Convergence of generalized SOR, Jacobi and Gauss-Seidel methods for linear systems
- On linear convergence of iterative methods for the variational inequality problem
Cites Work
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Title not available (Why is that?)
- Convergence of a generalized SMO algorithm for SVM classifier design
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Title not available (Why is that?)
- Downlink beamforming for DS-CDMA mobile radio with multimedia services
- Globally convergent block-coordinate techniques for unconstrained optimization
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Evolution towards the maximum clique
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- A convergent decomposition algorithm for support vector machines
- Parallel Variable Distribution
- Title not available (Why is that?)
- On the convergence of a modified version of SVMlightalgorithm
- A convergent decomposition method for box-constrained optimization problems
Cited In (3)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
Uses Software
This page was built for publication: On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537652)
