A Relax Inexact Accelerated Proximal Gradient Method for the Constrained Minimization Problem of Maximum Eigenvalue Functions
For constrained minimization problem of maximum eigenvalue functions, since the objective function is nonsmooth, we can use the approximate inexact accelerated proximal gradient (AIAPG) method (Wang et al., 2013) to solve its smooth approximation minimization problem. When we take the function g(X)=...
Saved in:
| Main Authors: | Wei Wang, Shanghua Li, Jingjing Gao |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/749475 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Inexact Version of Bregman Proximal Gradient Algorithm
by: S. Kabbadj
Published: (2020-01-01) -
A Generalized Inexact Newton Method for Inverse Eigenvalue Problems
by: Weiping Shen
Published: (2014-01-01) -
Two-step inexact Newton-like method for solving generalized inverse eigenvalue problems
by: Liuqing Hua, et al.
Published: (2025-05-01) -
A Three-Block Inexact Heterogeneous Alternating Direction Method of Multipliers for Elliptic PDE-Constrained Optimization Problems with a Control Gradient Penalty Term
by: Xiaotong Chen, et al.
Published: (2024-10-01) -
Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
by: Ram U. Verma
Published: (2009-01-01)