New algorithms for maximization of concave functions with box constraints
A. Friedlander, J. M. Martinez (1992)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A. Friedlander, J. M. Martinez (1992)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Ana Friedlander, José Mario Martínez (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi (2007)
RAIRO - Operations Research
Similarity:
This paper presents a feasible primal algorithm for linear semidefinite programming. The algorithm starts with a strictly feasible solution, but in case where no such a solution is known, an application of the algorithm to an associate problem allows to obtain one. Finally, we present some numerical experiments which show that the algorithm works properly.
Liu, San-Yang, Wang, Chun-Feng, Liu, Li-Xia (2010)
Mathematical Problems in Engineering
Similarity:
José Mario Martínez, Sandra Augusta Santos (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Yves Smeers (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)
Mathematical Problems in Engineering
Similarity:
Paulo J.S. Silva, Carlos Humes (2007)
RAIRO - Operations Research
Similarity:
We present an inexact interior point proximal method to solve linearly constrained convex problems. In fact, we derive a primal-dual algorithm to solve the KKT conditions of the optimization problem using a modified version of the rescaled proximal method. We also present a pure primal method. The proposed proximal method has as distinctive feature the possibility of allowing inexact inner steps even for Linear Programming. This is achieved by using an error criterion that ...
Yeniay, Ozgur (2005)
Mathematical Problems in Engineering
Similarity:
J. F. Bonnans, M. Bouhtou (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: