Rescaled proximal methods for linearly constrained convex problems

E-ISSN： 1290-3868|41|4|367-380

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.41, Iss.4, 2007-10, pp. : 367-380

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

Limited memory solution of bound constrained convex quadratic problems arising in video games

By Ferris Michael C. Wathen Andrew J. Armand Paul

RAIRO - Operations Research, Vol. 41, Iss. 1, 2007-06 ,pp. : 19-34

Edp Sciences

Access to resources Recommend Favorite

Strict convex regularizations, proximal points and augmented lagrangians

By Carlos Humes Jr. Paulo Jose Da Silva E Silva

RAIRO - Operations Research, Vol. 34, Iss. 3, 2010-03 ,pp. : 283-303

Edp Sciences

Access to resources Recommend Favorite

Tractable algorithms for chance-constrained combinatorial problems

By Klopfenstein Olivier

RAIRO - Operations Research, Vol. 43, Iss. 2, 2009-04 ,pp. : 157-187

Edp Sciences

Access to resources Recommend Favorite

Flow Polyhedra and Resource Constrained Project Scheduling Problems

By Quilliot Alain Toussaint Hélène

RAIRO - Operations Research, Vol. 46, Iss. 4, 2012-12 ,pp. : 373-409

Edp Sciences

Access to resources Recommend Favorite

Minimum convex-cost tension problems on series-parallel graphs

By Bachelet Bruno Mahey Philippe

RAIRO - Operations Research, Vol. 37, Iss. 4, 2010-03 ,pp. : 221-234

Edp Sciences

Access to resources Recommend Favorite