On implementation of a self-dual embedding method for convex programming

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.21, Iss.1, 2006-02, pp. : 75-103

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

Convex combinations in terms of triangular norms: A characterization of idempotent, bisymmetrical and self-dual compensatory operators

By Moser B. Tsiporkova E. Klement E.P.

Fuzzy Sets and Systems, Vol. 104, Iss. 1, 1999-05 ,pp. : 97-108

Elsevier

Access to resources Recommend Favorite

A Continuous Method for Convex Programming Problems

By Liao L.

Journal of Optimization Theory and Applications, Vol. 124, Iss. 1, 2005-01 ,pp. : 207-226

Springer Publishing Company

Access to resources Recommend Favorite

Experimental constructions of self-dual codes

By Gaborit P. Otmani A.

Finite Fields and Their Applications, Vol. 9, Iss. 3, 2003-07 ,pp. : 372-394

Elsevier

Access to resources Recommend Favorite

Nonlinear Proximal Decomposition Method for Convex Programming

By Kyono M. Fukushima M.

Journal of Optimization Theory and Applications, Vol. 106, Iss. 2, 2000-08 ,pp. : 357-372

Springer Publishing Company

Access to resources Recommend Favorite

Inner Approximation Method for a Reverse Convex Programming Problem

By Yamada S. Tanino T. Inuiguchi M.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 2, 2000-11 ,pp. : 355-389

Springer Publishing Company

Access to resources Recommend Favorite