A modified projection algorithm for large strictly-convex quadratic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1341943 (Why is no real title available?)
- scientific article; zbMATH DE number 1064843 (Why is no real title available?)
- scientific article; zbMATH DE number 1569000 (Why is no real title available?)
- scientific article; zbMATH DE number 1424212 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Iterative methods for variational and complementarity problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Sequential quadratic programming methods for large-scale problems
- Solution of symmetric linear complementarity problems by iterative methods
- Solving a class of linear projection equations
- Splitting methods for constrained quadratic programs in data analysis
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(16)- A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint
- scientific article; zbMATH DE number 1569000 (Why is no real title available?)
- A variational approach to Gibbs artifacts removal in MRI
- scientific article; zbMATH DE number 1382488 (Why is no real title available?)
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
- 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
- scientific article; zbMATH DE number 2202887 (Why is no real title available?)
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- A new steplength selection for scaled gradient methods with application to image deblurring
- scientific article; zbMATH DE number 1894333 (Why is no real title available?)
- The nearest point problem in a polyhedral set and its extensions
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- An active index algorithm for the nearest point problem in a polyhedral cone
- Gradient projection methods for quadratic programs and applications in training support vector machines
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
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)
