Dual fast projected gradient method for quadratic programming
From MaRDI portal
Publication:1947612
DOI10.1007/s11590-012-0476-6zbMath1292.90224OpenAlexW2063200193MaRDI QIDQ1947612
James Costa, Saba Neyshabouri, Roman A. Polyak
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
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Methods of reduced gradient type (90C52)
Related Items
Fast projected gradient method for support vector machines, A new fast algorithm for constrained four-directional total variation image denoising problem, A dual gradient-projection method for large-scale strictly convex quadratic problems, On computational search for Nash equilibrium in hexamatrix games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Modified barrier functions (theory and methods)
- Topics in semidefinite and interior-point methods
- Introductory lectures on convex optimization. A basic course.
- New Proximal Point Algorithms for Convex Minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Estimation of Dependences Based on Empirical Data
- Convex programming in Hilbert space