Puzzle Zeitvertreib Beste 4K Filme Beste Multimedia-Lernspiele % SALE %

Large Scale Optimization: State of the Art


Large Scale Optimization: State of the Art
189.18 CHF
Versandkostenfrei

Lieferzeit: 7-14 Werktage

  • 10364446


Beschreibung

Preface. Restarting Strategies for the DQA Algorithm; A.J. Berger, J.M. Mulvey, A. Ruszczynski. Mathematical Equivalence of the Auction Algorithm for Assignment and the epsilon-Relaxation (Preflow-Push) Method for Min Cost Flow; D.P. Bertsekas. Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming; M.G. Breitfeld, D.F. Shanno. A New Stochastic/Perturbation Method for Large-Scale Global Optimization and its Application to Water Cluster Problems; R.H. Byrd, T. Derby, E. Eskow, K.P.B. Oldenkamp, R.B. Schnabel. Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach; A.R. Conn, N. Gould, P.L. Toint. Gradient-Related Constrained Minimization Algorithms in Function Spaces: Convergence Properties and Computational Implications; J.C. Dunn. Some Reformulations and Applications of the Alternating Direction Method of Multipliers; J. Eckstein, M. Fukushima. Experience with a Primal Presolve Algorithm; R. Fourer, D.M. Gay. A Trust Region Method for Constrained Nonsmooth Equations; S.A. Gabriel, Jong-Shi Pang. On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems; J.-L. Goffin, Zhi-Quan Luo, Yinyu Ye. Identificiation of the Support of Nonsmoothness; C.T. Kelley. On Very Large Scale Assignment Problems; Y. Lee, J.B. Orlin. Numerical Solution of Parabolic State Constrained Control Problems Using SQP and Interior-Point-Methods; F. Leibfritz, E.W. Sachs. A Global Optimization Method for Weber's Problem with Attraction and Repulsion; C.D. Maranas, C.A. Floudas. Large-Scale Diversity Minimization via Parallel Genetic Algorithms; R.R. Meyer, J. Yackel. A Numerical Comparison of Barrier andModified Barrier Methods for Large-Scale Bound-Constrained Optimization; S.G. Nash, R. Polyak, A. Sofer. A Numerical Study of Some Data Association Problems Arising in Multitarget Tracking; A.B. Poore, N. Rijavec. Identifying the Optimal Face of a Network Linear Program with a Globally Convergent Interior Point Method; M.G.C. Resende, T. Tsuchiya, G. Veiga. Solution of Large Scale Stochastic Programs with Stochastic Decomposition Algorithms; S. Sen, J.Mai, J.L. Higle. A Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and Convex Quadratic Programming; A.L. Tits, J.L. Zhou. On Two Algorithms for Nonconvex Nonsmooth Optimization Problems in Structural Mechanics; M.Ap. Tzaferopoulos, E.S. Mistakidis, C.D. Bisbos, P.D. Panagiotopoulos.

Eigenschaften

Breite: 160
Höhe: 240
Seiten: 456
Sprachen: Englisch
Autor: D. W. Hearn, Panos M. Pardalos, William W. Hager

Bewertung

Bewertungen werden nach Überprüfung freigeschaltet.

Die mit einem * markierten Felder sind Pflichtfelder.

Ich habe die Datenschutzbestimmungen zur Kenntnis genommen.

Zuletzt angesehen

eUniverse.ch - zur Startseite wechseln © 2021 Nova Online Media Retailing GmbH