On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds

DOI10.1007/s11590-010-0214-xzbMath1242.90238OpenAlexW2053656372MaRDI QIDQ537652

Mauro Piacentini, Laura Palagi, 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

zbMATH Keywords

decomposition methodJacobi-type iteration

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

An almost cyclic 2-coordinate descent method for singly linearly constrained problems, 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

Uses Software

• CONV_QP
• GPDT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A convergent decomposition method for box-constrained optimization problems
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Evolution towards the maximum clique
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• A convergent decomposition algorithm for support vector machines
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Globally convergent block-coordinate techniques for unconstrained optimization
• Parallel Variable Distribution
• Downlink beamforming for DS-CDMA mobile radio with multimedia services
• On the convergence of a modified version of SVM^lightalgorithm
• Gradient projection methods for quadratic programs and applications in training support vector machines
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Convergence of a generalized SMO algorithm for SVM classifier design