A modified projection algorithm for large strictly-convex quadratic programs

DOI10.1023/A:1004605612267zbMath0962.90036MaRDI QIDQ1579656

Valeria Ruggiero, Luca Zanni

Publication date: 14 September 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

large-scale optimizationsplitting methodprojection-type methodstrictly-convex quadratic programs

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items

Gradient projection methods for quadratic programs and applications in training support vector machines, A new steplength selection for scaled gradient methods with application to image deblurring, An improved gradient projection-based decomposition technique for support vector machines, On the working set selection in gradient projection-based decomposition techniques for support vector machines, The nearest point problem in a polyhedral set and its extensions, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, An active index algorithm for the nearest point problem in a polyhedral cone, A variational approach to Gibbs artifacts removal in MRI

Uses Software

• NAG
• CONV_QP
• nag

Cites Work

• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• Solution of symmetric linear complementarity problems by iterative methods
• Solving a class of linear projection equations
• Sequential quadratic programming methods for large-scale problems
• Splitting methods for constrained quadratic programs in data analysis
• On the convergence of projection methods: Application to the decomposition of affine variational inequalities
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• Iterative methods for variational and complementarity problems
• Modified Projection-Type Methods for Monotone Variational Inequalities
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item