Смотреть

Весь архив

Главная
по журналам

по журналам "Optimization"

Отображаемые элементы 1-20 из 1286

Следующая страница

4th International workshop on generalized convexity

Неизвестный автор (Akademic-Verlag, 1991)
A anonmonotone line search technique for improved projected quasi-newton methods<sup>*</sup>this research was supported in party by the national natural science foundation of china$ef:

Zhu, Detong.; Zhu, Detong.; Dept. of Mathematics, Shanghai Normal University (Gordon and Breach Science Publishers, 1993)
A bilinear approach to the pooling problem

Foulds, L.R.; Haugland, D.; JÖrnsten, K.; Foulds, L.R.; Department of Management Science and Systems, University of Waikato; Haugland, D.; Dept. of Science and Technology, Chr. Michelsen Institute; JÖrnsten, K.; Institute for Finance and Management Science, The Norwegian School of Economics and Business Administration (Gordon and Breach Science Publishers, 1992)
A branch and bound algorithm for minimizing weighted completion times with deadlines

Werner, F.; Werner, F.; Inst. fur Mathematische Optimierung, Technische Universität “Otto von Guericke” Magdeburg (Gordon and Breach Science Publishers, 1993)
A chain rule for parabolic second-order epiderivatives

Ward, D.E.; Ward, D.E.; Department of Mathematics and Statistics, Miami University (Gordon and Breach Science Publishers, 1994)
A characterization of continuously codifferentiable functions and some consequences

Kuntz, L.; Kuntz, L.; Inst. f. Statistik u. Math. Wirtschaftstheorie, Universitat Karlsruhe (Akademic-Verlag, 1991)
A class of algorithms for computing the minimal value of a convex function f over[0 1] <sup>k</sup> within accuracy ∈, when the evaluations of f are made within accuracy ∈

Fiala, T.; Sonnevend, G.; Fiala, T.; Department of Numerical Analysis and Computer Sciences, Eötvös Loránd University Budapest; Sonnevend, G.; Department of Numerical Analysis and Computer Sciences, Eötvös Loránd University Budapest (Akademic-Verlag, 1986)
A class of exhaustive cone splitting procedures in conical algorithms for concave minmization

Tuy, Hoang; Khatchaturov, V.; Utkin, S.; Tuy, Hoang; Institute of Mathematics, Vien Toán Hoc; Khatchaturov, V.; Academy of Sciences, Computer Center; Utkin, S.; Academy of Sciences, Computer Center (Akademic-Verlag, 1987)
A class of generalised minimum effort problems in locally convex linear topological spaces

Chakraborty, G.; Chakraborty, G.; Dept of Mathematics, University of Burdwan (Gordon and Breach Science Publishers, 1992)
A Class of penalty functions for optimization problema with bound constraints

Facchinei, F.; Lucidi, S.; Facchinei, F.; Dipartimento di Informatica e Sistemistica, Universita di Roma “La Sapienza“; Lucidi, S.; Istituto di Analisi dei Sistemi e Informatica del CNR (Gordon and Breach Science Publishers, 1992)
A class of procedures to compute the optimal value f unction in a Markovian decision problem

Löbus, J.U.; Löbus, J.U.; Sektion Mathematik, Friedrich-Schiller-Universität Jena (Akademic-Verlag, 1986)
A code for linear least squares based upon the ABS procedure

Bodon, Elena; Bodon, Elena; Dept. of Mathematics, University of Genua; Dipartimento di Matematica, Universita di Genova (Akademic-Verlag, 1990)
A Coincidence result between sets of efficient points and choquet boundaries in separated locally convex spaces

Bucur, I.; PostolicÃ, V.; Bucur, I.; Department of Mathematic; PostolicÃ, V.; Department of Mathematic (Gordon and Breach Science Publishers, 1996)
A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks

Beichelt, F.; Tittmann, F.; Beichelt, F.; Dept, of Mathematics, Engineering College Mittweida; Ingenieurhochschule Mittweida; Tittmann, F.; Dept, of Mathematics, Engineering College Mittweida; Ingenieurhochschule Mittweida (Akademic-Verlag, 1990)
A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Arsham, H.; Oblak, M.; Arsham, H.; Information and Quantitatice Sciences, Uniuersity of Baltimore; Oblak, M.; Information and Quantitatice Sciences, Uniuersity of Baltimore (Gordon and Breach Science Publishers, 1995)
A concentration inequality for maximum matching size in random graphs

Rhee, Wansoo T.; Rhee, Wansoo T.; Faculty of Management Science, The Ohio State University (Akademic-Verlag, 1990)
A constraint qualification in quasidifferentiable programming

Ward, D.E.; Ward, D.E.; Dept. of Math. and Stat, Miami University (Akademic-Verlag, 1991)
A continuous set covering problem as a quasidifferentiable optimization problem

Jandl, H.; Wieder, K.; Jandl, H.; Inst. f. Statistik and math, Wirtschaftstheorie der Universität Karlsruhe; Wieder, K.; Inst. f. Statistik and math, Wirtschaftstheorie der Universität Karlsruhe (Akademic-Verlag, 1988)
A contribution to quadratic assignment problems

Bookhold, Ines; Bookhold, Ines; Sektion Mathematik, Ernst-Moritz-Arndt-Universität (Akademic-Verlag, 1990)
A convergent criss-cross method

Terlaky, T.; Terlaky, T.; Department of Operations Research, Eötvös Lorand University (Akademic-Verlag, 1985)

Отображаемые элементы 1-20 из 1286

Следующая страница

Смотреть

Весь архив

по журналам "Optimization"