In:
Journal of Applied Mathematics, Hindawi Limited, Vol. 2014 ( 2014), p. 1-7
Abstract:
We present an approximate nonsmooth algorithm to solve a minimization problem, in which the objective function is the sum of a maximum eigenvalue function of matrices and a convex function. The essential idea to solve the optimization problem in this paper is similar to the thought of proximal bundle method, but the difference is that we choose approximate subgradient and function value to construct approximate cutting-plane model to solve the above mentioned problem. An important advantage of the approximate cutting-plane model for objective function is that it is more stable than cutting-plane model. In addition, the approximate proximal bundle method algorithm can be given. Furthermore, the sequences generated by the algorithm converge to the optimal solution of the original problem.
Type of Medium:
Online Resource
ISSN:
1110-757X
,
1687-0042
Language:
English
Publisher:
Hindawi Limited
Publication Date:
2014
detail.hit.zdb_id:
2578385-3
SSG:
17,1
