Convex- and Monotone-Transformable Mathematical Programming Problems and a Proximal-Like Point Method

Author： Cruz Neto J.   Ferreira O.   Pérez L.   Németh S.  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.35, Iss.1, 2006-05, pp. : 53-69

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 logarithmic-quadratic proximal point scalarization method for multiobjective programming

By Gregório Ronaldo   Oliveira Paulo  

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 281-291

Springer Publishing Company

Access to resources Recommend Favorite

Approximating zeros of monotone operators by proximal point algorithms

By Qin Xiaolong   Kang Shin   Cho Yeol  

Journal of Global Optimization, Vol. 46, Iss. 1, 2010-01 ,pp. : 75-87

Springer Publishing Company

Access to resources Recommend Favorite

Proximal methods for a class of bilevel monotone equilibrium problems

By Moudafi Abdellatif  

Journal of Global Optimization, Vol. 47, Iss. 2, 2010-06 ,pp. : 287-292

Springer Publishing Company

Access to resources Recommend Favorite

A homotopy interior point method for semi-infinite programming problems

By Liu Guo-xin  

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 631-646

Springer Publishing Company

Access to resources Recommend Favorite

A Regularization Method for the Proximal Point Algorithm

By Xu Hong-Kun  

Journal of Global Optimization, Vol. 36, Iss. 1, 2006-09 ,pp. : 115-125

Springer Publishing Company

Access to resources Recommend Favorite