Decompositions of compact convex sets.
Page 1
Displaying 1 – 18 of 18
Decrease of C1,1 property in vector optimization
Dušan Bednařík, Karel Pastor (2009)
RAIRO - Operations Research
In the paper we generalize sufficient and necessary optimality conditions obtained by Ginchev, Guerraggio, Rocca, and by authors with the help of the notion of ℓ-stability for vector functions.
Der Satz von Fenchel in der konvexen Optimierung.
Reiner Horst (1977)
Jahresbericht der Deutschen Mathematiker-Vereinigung
Derivative Free Analogues of the Levenberg-Marquardt and Gauss Algorithms for Nonlinear Least Squares Approximation.
K.M. Brown, J.E. jr. Dennis (1971/1972)
Numerische Mathematik
Derivative-free nonlinear optimization filter simplex
Aldina Correia, João Matias, Pedro Mestre, Carlos Serodio (2010)
International Journal of Applied Mathematics and Computer Science
The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence...
Des exemples de programmation non linéaire en théorie des nombres
Jean-Louis NICOLAS (1972/1973)
Seminaire de Théorie des Nombres de Bordeaux
Des exemples de programmation non linéaire en théorie des nombres
Jean-Louis Nicolas (1972/1973)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Deux modèles de minimisation d'une fonction économique concave
Claude-Alain Burdet (1970)
RAIRO - Operations Research - Recherche Opérationnelle
Deux problèmes d'affectation non linéaires
M. Beghin-Picavet, P. Hansen (1982)
RAIRO - Operations Research - Recherche Opérationnelle
Diameter, Width, Closest Line Pair, and Parametric Searching.
H. Edelsbrunner, B. Chazelle, M. Sharir, L. Guibas (1993)
Discrete & computational geometry
Differential evolution algorithm combined with chaotic pattern search
Yaoyao He, Jianzhong Zhou, Ning Lu, Hui Qin, Youlin Lu (2010)
Kybernetika
Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional space....
Directional lipschitzian optimal solutions and directional derivative for the optimal value function in nonlinear mathematical programming
J. Gauvin, R. Janin (1989)
Annales de l'I.H.P. Analyse non linéaire
Discrepancy Method for Solving Multistage Minimization Problem
Milojica Jaćimović, Fedor Pavlovič Vasiljev (1992)
The Yugoslav Journal of Operations Research
Dual of a linear fractional program through geometric programming
Aggarwal, S.P., Patkar, V.N. (1978)
Portugaliae mathematica
Duality in set-valued optimization [Book]
Song Wen (1998)
Duality in vector optimization. I. Abstract duality scheme
Tran Quoc Chien (1984)
Kybernetika
Duality of transformation functions in the interior point methods.
Halická, M., Hamala, M. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Duality theorems for a class of non-linear programming problems.
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.
Currently displaying 1 – 18 of 18
Page 1