An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.67, Iss.2, 2008-04, pp. : 187-206

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Subgradient Method for Nonconvex Nonsmooth Optimization

By Bagirov A.

Journal of Optimization Theory and Applications, Vol. 157, Iss. 2, 2013-05 ,pp. : 416-435

Springer Publishing Company

Access to resources Recommend Favorite

Gradient set splitting in nonconvex nonsmooth numerical optimization

By Gaudioso Manlio Gorgone Enrico

Optimization Methods and Software, Vol. 25, Iss. 1, 2010-02 ,pp. : 59-74

Taylor & Francis Ltd

Access to resources Recommend Favorite

Solution of Nonconvex Nonsmooth Stochastic Optimization Problems

By Ermoliev Yu. M. Norkin V. I.

Cybernetics and Systems Analysis, Vol. 39, Iss. 5, 2003-09 ,pp. : 701-715

Springer Publishing Company

Access to resources Recommend Favorite

The exact penalty map for nonsmooth and nonconvex optimization

Optimization, Vol. 64, Iss. 4, 2015-04 ,pp. : 717-738

Taylor & Francis Ltd

Access to resources Recommend Favorite

Convergence Properties of the Regularized Newton Method for the Unconstrained Nonconvex Optimization

By Ueda Kenji Yamashita Nobuo

Applied Mathematics and Optimization, Vol. 62, Iss. 1, 2010-08 ,pp. : 27-46

Springer Publishing Company

Access to resources Recommend Favorite