A compact variable metric algorithm for linearly constrained nonlinear minimax approximation
Ladislav Lukšan (1985)
Kybernetika
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.
Displaying similar documents to “An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation”
A compact variable metric algorithm for linearly constrained nonlinear minimax approximation
A Modified Step-Length Algorithm in Nonlinear Programming
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
Conjugate direction algorithms for extended conic functions
Ladislav Lukšan (1986)
Kybernetika
Similarity:
A New Exterior Point Algorithm for Linear Programming Problems
Konstantinos Dosios, Konstantinos Paparrizos (1994)
The Yugoslav Journal of Operations Research
Similarity:
A Slight Modification of the First Phase of the Simplex Algorithm
T. Divnić, Lj. Pavlović (2012)
The Yugoslav Journal of Operations Research
Similarity:
On the acceleration of adaptation processes by two-step principles
Klaus Fritzsch (1977)
Kybernetika
Similarity:
Effects of ordering and updating techniques on the performance of the Karmarkar algorithm
Abdellah Salhi, George R. Lindfield (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Nonmonotone strategy for minimization of quadratics with simple constraints
M. A. Diniz-Ehrhardt, Zdeněk Dostál, M. A. Gomes-Ruggiero, J. M. Martínez, Sandra Augusta Santos (2001)
Applications of Mathematics
Similarity:
An algorithm for quadratic minimization with simple bounds is introduced, combining, as many well-known methods do, active set strategies and projection steps. The novelty is that here the criterion for acceptance of a projected trial point is weaker than the usual ones, which are based on monotone decrease of the objective function. It is proved that convergence follows as in the monotone case. Numerical experiments with bound-constrained quadratic problems from CUTE collection show...