A customized proximal point algorithm for convex minimization with linear constraints

Author： He Bingsheng   Yuan Xiaoming   Zhang Wenxing  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.56, Iss.3, 2013-12, pp. : 559-572

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 Projection Proximal-Point Algorithm for l1 Minimization

By Lorenz Dirk  

Numerical Functional Analysis and Optimization, Vol. 31, Iss. 2, 2010-02 ,pp. : 172-190

Taylor & Francis Ltd

Access to resources Recommend Favorite

Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming

By Recht P.   Schade P.H.  

Optimization, Vol. 56, Iss. 4, 2007-08 ,pp. : 495-514

Taylor & Francis Ltd

Access to resources Recommend Favorite

Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints

By Brito Arnaldo  

Journal of Optimization Theory and Applications, Vol. 154, Iss. 1, 2012-07 ,pp. : 217-234

Springer Publishing Company

Access to resources Recommend Favorite

Minimization of convex functions on the convex hull of a point set

By Botkin Nikolai  

Mathematical Methods of Operations Research, Vol. 62, Iss. 2, 2005-11 ,pp. : 167-185

Springer Publishing Company

Access to resources Recommend Favorite

Non-convex feasibility problems and proximal point methods

By Corvellec Jean-noël   Flåm Sjur Didrik  

Optimization Methods and Software, Vol. 19, Iss. 1, 2004-02 ,pp. : 3-14

Taylor & Francis Ltd

Access to resources Recommend Favorite