Concave programming for minimizing the zero-norm over polyhedral sets

Author： Rinaldi F.   Schoen F.   Sciandrone M.  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.46, Iss.3, 2010-07, pp. : 467-486

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

The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement

By Luo Ziyan   Qin Linxia   Kong Lingchen   Xiu Naihua  

Journal of Optimization Theory and Applications, Vol. 160, Iss. 3, 2014-03 ,pp. : 854-864

Springer Publishing Company

Access to resources Recommend Favorite

Zero polyhedral cones

By Xia X.  

Applied Mathematics Letters, Vol. 16, Iss. 6, 2003-08 ,pp. : 961-966

Elsevier

Access to resources Recommend Favorite

Area Minimizing Polyhedral Surfaces are Saddle

By Petrunin Anton  

American Mathematical Monthly, Vol. 122, Iss. 3, 2015-03 ,pp. : 264-267

Mathematical Association of America

Access to resources Recommend Favorite

Sufficiency of polyhedral surfaces in the modulus method and removable sets

By Dymchenko Yu.  

Academy of Sciences of the USSR Mathematical Notes, Vol. 90, Iss. 1-2, 2011-08 ,pp. : 204-217

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Result on Vector Variational Inequalities with Polyhedral Constraint Sets

By Lee G.M.   Yen N.D.  

Journal of Optimization Theory and Applications, Vol. 109, Iss. 1, 2001-04 ,pp. : 193-197

Springer Publishing Company

Access to resources Recommend Favorite