Result 1 to 16 of 16 total
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results. (English)
Math. Program. 127, No. 2 (A), 245-295 (2011).
1
A generic approach to approximate efficiency and applications to vector optimization with set-valued maps. (English)
J. Glob. Optim. 49, No. 2, 313-342 (2011).
2
A new relaxation scheme for mathematical programs with equilibrium constraints. (English)
SIAM J. Optim. 20, No. 5, 2504-2539 (2010).
3
Multiobjective bilevel optimization. (English)
Math. Program. 123, No. 2 (A), 419-449 (2010).
4
An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints. (English)
SIAM J. Optim. 20, No. 3, 1527-1546 (2009).
5
An adaptive scalarization method in multiobjective optimization. (English)
SIAM J. Optim. 19, No. 4, 1694-1718 (2009).
6
CNM ‒ a convergent method of Nelder and Mead type. (English)
Berichte aus der Mathmatik. Aachen: Shaker Verlag; Darmstadt: Diss. Darmstadt, Fachbereich Mathematik (Diss.) (ISBN 978-3-8322-7328-6/pbk). vi, 151~p. EUR~45.80 (2008).
7
Higher-order Mond-Weir duality for set-valued optimization. (English)
J. Comput. Appl. Math. 217, No. 2, 339-349 (2008).
8
Optimization with Hopfield neural systems. Application to the parametric identification of dynamical systems. (Optimización con sistemas neuronales de Hopfield. Aplicación a la identificación paramétrica de sistemas dinámicos.) (Spanish)
Joya Caparrós, Gonzalo (ed.) et al., Intelligent optimization. Computational intelligence techniques for optimization. Málaga: Unversidad de Málaga; Málaga: Red Andaluza de Tecnologías de Sistemas Inteligentes (ISBN 84-9747-034-6/pbk). 3-42 (2004).
9
Optimization theory. (English)
Boston, MA: Kluwer Academic Publishers (ISBN 1-4020-8098-0). xi, 443~p. EUR~69.00/net; \$~75.00; \sterling~48.00 (2004).
10
A more lenient stopping rule for line search algorithms. (English)
Optim. Methods Softw. 17, No. 4, 683-700 (2002).
11
Global optimization: Software, test problems, and applications. (English)
Pardalos, Panos M. (ed.) et al., Handbook of global optimization. Vol. 2. Dordrecht: Kluwer Academic Publishers. Nonconvex Optim. Appl. 62, 515-569 (2002).
12
Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds. (English)
J. Optim. Theory Appl. 113, No. 1, 21-40 (2002).
13
An interactive graphic presentation for multiobjective linear programming. (English)
Appl. Math. Comput. 123, No. 2, 229-248 (2001).
14
An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set. (English)
Eur. J. Oper. Res. 133, No.2, 267-286 (2001).
15
Convergence of the simulated annealing algorithm for continuous global optimization. (English)
J. Optimization Theory Appl. 104, No. 3, 691-716 (2000).
16
Result 1 to 16 of 16 total