Inner Approximation Method for a Reverse Convex Programming Problem

Author： Yamada S.   Tanino T.   Inuiguchi M.  

Publisher： Springer Publishing Company

ISSN： 0022-3239

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

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

Outer Approximation Method Incorporating a Quadratic Approximation for a DC Programming Problem

By Yamada S.   Tanaka T.   Tanino T.  

Journal of Optimization Theory and Applications, Vol. 144, Iss. 1, 2010-01 ,pp. : 156-183

Springer Publishing Company

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

Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems

By Aboussoror Abdelmalek   Adly Samir  

Numerical Functional Analysis and Optimization, Vol. 35, Iss. 7-9, 2014-07 ,pp. : 816-836

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Cheng Johnny   Zhang Shuzhong  

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

Taylor & Francis Ltd

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