On the numerical solution of bound constrained optimization problems
Ana Friedlander, José Mario Martínez (1989)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “New algorithms for maximization of concave functions with box constraints”
On the numerical solution of bound constrained optimization problems
New convergence results on an algorithm for norm constrained regularization and related problems
José Mario Martínez, Sandra Augusta Santos (1997)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
J. F. Bonnans, M. Bouhtou (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Inexact solution of auxiliary problems in Polyak type algorithms
Zdeněk Dostál (1999)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Global optimization for sum of linear ratios problem using new pruning technique.
Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)
Mathematical Problems in Engineering
Similarity:
A new method for nonsmooth convex optimization.
Wei, Z., Qi, L., Birge, J.R. (1998)
Journal of Inequalities and Applications [electronic only]
Similarity:
A modified algorithm for the strict feasibility problem
D. Benterki, B. Merikhi (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.