A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions

DOI10.1155/2014/749475zbMath1442.65105OpenAlexW2066032893WikidataQ59052212 ScholiaQ59052212MaRDI QIDQ2336689

Shanghua Li, Jingjing Gao, Wei Wang

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/749475

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Smooth minimization of non-smooth functions
• Gradient methods for minimizing composite functions
• Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
• Smooth convex approximation to the maximum eigenvalue function
• Proximity algorithms for image models: denoising
• An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
• Signal Recovery by Proximal Forward-Backward Splitting

This page was built for publication: A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions