Optimization Theory

Recent Developments from Mátraháza

AvFranco Gianness,Panos M. Pardalos

Inbunden, Engelska, 2001

Del i serien Applied Optimization

1 067 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume contains refereed papers based on lectures presented at the XIV International Conference on Mathematical Programming, held at Matrahaza, Hungary. The main purpose of the conference was to review and discuss advances and promising research trends concerning theory, algorithms, and applications in the fields of optimization theory, and related areas such as convex analysis, complementarity systems, and variational inequalities.

Produktinformation

Utgivningsdatum:2001-10-31
Mått:178 x 254 x 18 mm
Vikt:585 g
Format:Inbunden
Språk:Engelska
Serie:Applied Optimization
Antal sidor:280
Upplaga:2001
Förlag:Kluwer Academic Publishers
ISBN:9781402000096

Utforska kategorier

Innehållsförteckning

Heuristics for the Process Network Synthesis Problem.- Heuristics for Simplified Process Network Synthesis (PNS) Problems with a Blossom-Type Algorithm for the Edge Covering Problem.- Lower and Upper Bounds on the Probability of the Union of Some Events with Applications.- The Linear Complementarity Problem and the Class of Generalized Positive Subdefinite Matrices.- Computer Experiences with Successive Regression Approximations for Solving Equations.- A Bundle of Smooth Lagrangians in Mathematical Programming.- A Nontopological Two-function Minimax Theorem with Monotone Ttansformations of the Functional Values.- Non-smooth Optimization with Randomization.- The Sherman-Morrison Formula for the Determinant and its Application for Optimizing Quadratic Functions on Condition Sets Given by Extreme Generators.- Duality For D.C. Optimization Over Compact Sets.- Characterization of Monotone Operators by Using a Special Class of Preinvex Functions.- Two Approaches for Parallelizing the UEGO Algorithm.- Convexification of Functions by Nonlinear Coordinate Transformations.- Packing Equal Circles in a Square I. — Problem Setting and Bounds for Optimal Solutions.- Packing Equal Circles in a Square II. — New Results for up to 100 Circles Using the TAMSASS-PECS Algorithm.- On Duality for Quasi-convex Supremization and Reverse Convex Infimization.- A Minimization Problem in Function Spaces.