The modified subgradient algorithm based on feasible values

Author： Kasimbeyli Refail  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

Source： Optimization, Vol.58, Iss.5, 2009-07, pp. : 535-560

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 Algorithm on Riemannian Manifolds

By Ferreira O.P.   Oliveira P.R.  

Journal of Optimization Theory and Applications, Vol. 97, Iss. 1, 1998-04 ,pp. : 93-104

Springer Publishing Company

Access to resources Recommend Favorite

A clique-based algorithm for constructing feasible timetables

By Liu Yongkai   Zhang Defu   Chin Francis  

Optimization Methods and Software, Vol. 26, Iss. 2, 2011-04 ,pp. : 281-294

Taylor & Francis Ltd

Access to resources Recommend Favorite

An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization

By Bagirov Adil  

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

Springer Publishing Company

Access to resources Recommend Favorite

A proximal subgradient projection algorithm for linearly constrained strictly convex problems

By Ouorou Adam  

Optimization Methods and Software, Vol. 22, Iss. 4, 2007-08 ,pp. : 617-636

Taylor & Francis Ltd

Access to resources Recommend Favorite

Exact Algorithm for the Surrogate Dual of an Integer Programming Problem: Subgradient Method Approach

By   Kim S.  

Journal of Optimization Theory and Applications, Vol. 96, Iss. 2, 1998-02 ,pp. : 363-375

Springer Publishing Company

Access to resources Recommend Favorite