Two Conclusions of Points Produced by Incremental Sub-Gradient Method for the Non-Differentiable Optimal Problem in Hilbert Space

Li Ping Ge; Wen Song

doi:10.4028/www.scientific.net/AMR.926-930.3713

Paper Titles

Study on the Stability of Virtual Network Mapping Algorithm Based on the Improved Genetic Algorithm
p.3696

The Improvement of the Three Dimensional Douglas-Peucker Algorithm
p.3701

The Optimization of Roll Force Model in Hot Strip Mill
p.3705

The Research of the Digital Image-Processing of Colorful Painting
p.3709

Two Conclusions of Points Produced by Incremental Sub-Gradient Method for the Non-Differentiable Optimal Problem in Hilbert Space
p.3713

Value Reduction Algorithm Based on Attribute Union
p.3718

Study on the Integrated Method of SEM and DEMATEL
p.3722

A Study of the Micrometeorological Characteristics in the Surface Layer of Kangding Airport
p.3731

A Study on the Relationship between Capital Structure and Profitability Based on the Empirical Data of Listed Companies in Cultural Media Industry in China
p.3735

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 926-930Two Conclusions of Points Produced by Incremental...

Two Conclusions of Points Produced by Incremental Sub-Gradient Method for the Non-Differentiable Optimal Problem in Hilbert Space

Abstract:

The paper mainly research incremental sub-gradient method for the non-differentiable optimal problem in Hilbert space. And prove two conclusions about the sequence generated by this method.

You might also be interested in these eBooks

Progress in Applied Sciences, Engineering and Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

3713-3717

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.926-930.3713

Citation:

Cite this paper

Online since:

May 2014

Authors:

Li Ping Ge*, Wen Song

Keywords:

Hilbert Space, Incremental Sub-Gradient Method, Non-Differentiable Optimal Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] D. P. Bertsekas: SIAM J. Optimal. Vol. 7(1997), pp.913-926.

Google Scholar

[2] Z.Q. Luo: Neural Computation, Vol. 3(1991), pp.226-245.

Google Scholar

[3] V. M. Kibardin: Automt. Remote Control, Vol. 40(1980), pp.1311-1323.

Google Scholar

[4] A. Ben-Tal,T. Margalit and A. Nemirovski: SIAM J. Optimal. Vol. 12(2001), p.79–108.

Google Scholar

[5] A. Nedi and D. P. Bertsekas: Stochastic Optimization, Algorithms and Applications(2000).

Google Scholar

[6] A. Nedi, D. P. Bertsekas and V. S. Borkar: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, (2001).

Google Scholar

[7] C.A. Kaskavelis and M.C. Caramanis: Transactions on Scheduling and Logistics, Vol. 30(1998), pp.1085-1097.

Google Scholar

[8] Y.I. Alber A.N. Iusem and M.V. Solodov: On the projected sub-gradient method for non-smooth convex optimization in a Hilbert space, Math. Programming, Vo. 81(1998), pp.23-35.

DOI: 10.1007/bf01584842

Google Scholar

[9] Paul-Emile Ming: Strong Convergence of Projected Sub-gradient Method for Non-smooth and Non-strictly Convex Minimization, Set-Valued Anal, Vo. 16(2008), pp.899-912.

DOI: 10.1007/s11228-008-0102-z

Google Scholar

[10] P. Zhang and W. Song: Jounal of Mathematics. Vol. 3(2009).

Google Scholar