Dual fast projected gradient method for quadratic programming
From MaRDI portal
Publication:1947612
DOI10.1007/S11590-012-0476-6zbMATH Open1292.90224OpenAlexW2063200193MaRDI QIDQ1947612FDOQ1947612
James Costa, Roman A. Polyak, Saba Neyshabouri
Publication date: 23 April 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0476-6
Recommendations
- A fast dual proximal gradient algorithm for convex minimization and applications
- Convergence analysis of augmented Lagrangian-fast projected gradient method for convex quadratic problems
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Soft inequality constraints in gradient method and fast gradient method for quadratic programming
- Benchmarking large-scale distributed convex quadratic programming algorithms
Quadratic programming (90C20) Abstract computational complexity for mathematical programming problems (90C60) Methods of reduced gradient type (90C52)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Convex programming in Hilbert space
- Modified barrier functions (theory and methods)
- Estimation of Dependences Based on Empirical Data
- Title not available (Why is that?)
- Topics in semidefinite and interior-point methods
- On the Goldstein-Levitin-Polyak gradient projection method
- New Proximal Point Algorithms for Convex Minimization
Cited In (8)
- Gradient projection-based performance improvement for JLQ problems
- A finite gradient-projective solver for a quadratic programming problem
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Fast projected gradient method for support vector machines
- A new fast algorithm for constrained four-directional total variation image denoising problem
- Title not available (Why is that?)
- On computational search for Nash equilibrium in hexamatrix games
- A dual gradient-projection method for large-scale strictly convex quadratic problems
This page was built for publication: Dual fast projected gradient method for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947612)
