A modified projection algorithm for large strictly-convex quadratic programs
From MaRDI portal
DOI10.1023/A:1004605612267zbMATH Open0962.90036MaRDI QIDQ1579656FDOQ1579656
Authors: V. Ruggiero, Luca Zanni 
Publication date: 14 September 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
Cites Work
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- Title not available (Why is that?)
- Solution of symmetric linear complementarity problems by iterative methods
- 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
- Sequential quadratic programming methods for large-scale problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving a class of linear projection equations
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Splitting methods for constrained quadratic programs in data analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- A variational approach to Gibbs artifacts removal in MRI
- Title not available (Why is that?)
- The nearest point problem in a polyhedral set and its extensions
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Title not available (Why is that?)
- A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint
- An active index algorithm for the nearest point problem in a polyhedral cone
- On the working set selection in gradient projection-based decomposition techniques for support vector machines
- Title not available (Why is that?)
- An improved gradient projection-based decomposition technique for support vector machines
- A new steplength selection for scaled gradient methods with application to image deblurring
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Title not available (Why is that?)
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
Uses Software
This page was built for publication: A modified projection algorithm for large strictly-convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579656)
