Advances in Convex Analysis and Global Optimization: Honoring the Memory of C. Caratheodory (1873-1950)Springer Science & Business Media, 30 thg 6, 2001 - 594 trang There has been much recent progress in global optimization algo rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by the General Secretariat of Research and Tech nology of Greece, by the Ministry of Education of Greece, and several local Greek government agencies and companies. This volume contains a selective collection of refereed papers based on invited and contribut ing talks presented at this conference. The two themes of convexity and global optimization pervade this book. The conference provided a forum for researchers working on different aspects of convexity and global opti mization to present their recent discoveries, and to interact with people working on complementary aspects of mathematical programming. |
Nội dung
III | 1 |
V | 11 |
VI | 31 |
VII | 75 |
VIII | 105 |
IX | 119 |
XI | 135 |
XII | 153 |
XXVII | 345 |
XXVIII | 361 |
XXIX | 371 |
XXX | 383 |
XXXI | 395 |
XXXII | 409 |
XXXIII | 421 |
XXXIV | 433 |
XVI | 181 |
XVII | 205 |
XVIII | 221 |
XIX | 235 |
XX | 245 |
XXI | 269 |
XXII | 283 |
XXIII | 295 |
XXIV | 303 |
XXV | 319 |
XXVI | 333 |
XXXV | 445 |
XXXVI | 459 |
XXXVII | 473 |
XXXVIII | 487 |
XXXIX | 501 |
XL | 515 |
XLI | 531 |
XLII | 545 |
XLIII | 553 |
XLIV | 569 |
Ấn bản in khác - Xem tất cả
Advances in Convex Analysis and Global Optimization: Honoring the Memory of ... Nicolas Hadjisavvas,Panos M. Pardalos Xem trước bị giới hạn - 2013 |
Advances in Convex Analysis and Global Optimization: Honoring the Memory of ... Nicolas Hadjisavvas,Panos M. Pardalos Không có bản xem trước - 2011 |
Thuật ngữ và cụm từ thông dụng
Advances in Convex algorithm Analysis and Global analytic center applied approach approximation branch and bound calculated Carathéodory closed proper combinatorial computational concave concave function condition consider constraints convergence Convex Analysis convex function convex set corresponding d.c. programs defined denote differentiable duality eigenvalue energy conformation ePLP equation equivalent feasible finite formulation free energy given global minimum global optimization gradient graph Hadjisavvas and P.M. hypergraph interval iteration Kluwer Academic Publishers Lagrangian Lemma linear linear programming Lipschitz lower bound Mathematics matrix max-cut maximal minimization monotone nonconvex objective function obtained operator optimal value optimization problem P.M. Pardalos eds parameters polynomial positive Proof proper convex function Proposition protein folding quadratic random relaxation semidefinite semidefinite programming sequence solution solving space structure subset Theorem theory tion upper bound variables variational inequality vector weight