A finite steps algorithm for solving convex feasibility problems

Author： Rami M.   Helmke U.   Moore J.  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.38, Iss.1, 2007-05, pp. : 143-160

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

A Finite Algorithm for Solving Infinite Dimensional Optimization Problems

By Schochetman I.E.  

Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. : 119-142

Springer Publishing Company

Access to resources Recommend Favorite

Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm

By Etoa Jean  

Journal of Global Optimization, Vol. 47, Iss. 4, 2010-08 ,pp. : 615-637

Springer Publishing Company

Access to resources Recommend Favorite

A Numerical Approach for Solving Some Convex Maximization Problems

By Enkhbat R.   Barsbold B.   Kamada Masaru  

Journal of Global Optimization, Vol. 35, Iss. 1, 2006-05 ,pp. : 85-101

Springer Publishing Company

Access to resources Recommend Favorite

On descent-projection method for solving the split feasibility problems

By Bnouhachem Abdellah  

Journal of Global Optimization, Vol. 54, Iss. 3, 2012-11 ,pp. : 627-639

Springer Publishing Company

Access to resources Recommend Favorite

An approximation algorithm for convex multi-objective programming problems

By Ehrgott Matthias  

Journal of Global Optimization, Vol. 50, Iss. 3, 2011-07 ,pp. : 397-416

Springer Publishing Company

Access to resources Recommend Favorite