Cover Image

Advances in convex analysis and global optimization : honoring the memory of C. Caratheodory (1873-1950) /

Show other versions (1)

There has been much recent progress in global optimization algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fundamental role in the analysis and development of global optimization algorithms. This is due to the fac...

Full description

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Carathéodory, Constantin, 1873-1950 (honouree.), Hadjisavvas, Nicolas, 1953- (Editor), Pardalos, P. M. (Panos M.), 1954- (Editor)
Format: eBook
Language:English
Published: Dordrecht ; Boston : Kluwer Academic Publishers, [2001]
Series:Nonconvex optimization and its applications ; volume 54.
Subjects:
Convex functions > Congresses.
Mathematical optimization > Congresses.
Nonlinear programming > Congresses.
Globale Optimierung.
Kongress.
Konvexe Analysis.
Convex functions.
Mathematical optimization.
Nonlinear programming.
Electronic books.
Pythagorion (2000)
Conference proceedings.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • 1. Inner Approximation of State-constrained Optimal Control Problems
  • 2. Nonsmooth Problems in Mathematical Diagnostics
  • 3. Deterministic Global Optimization for Protein Structure Prediction
  • 4. Some Remarks on Minimum Principles
  • 5. Transversal Hypergraphs and Families of Polyhedral Cones
  • 6. SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint
  • 7. Convex Analysis in the Calculus of Variations
  • 8. Global Minimization and Parameter Estimation in Computational Biology
  • 9. Lagrangian Quadratic Bounds in Polynomial Nonconvex and Boolean Models with Superfluous Constraints
  • 10. Generalized Duality in Variational Analysis
  • 11. Clustering via D. C. Optimization
  • 12. Algorithms and Merit Functions for the Principal Eigen-value
  • 13. Modified Versions of the Cutting Angle Method
  • 14. Theoretical and Computational Results for a Linear Bilevel Problem
  • 15. The Lagrangian Search Method
  • 16. An ?maximum Principle for Generalized Control Systems
  • 17. D.C. Optimization Approaches via Markov Models for Restoration of Signal (1-D) and (2-D)
  • 18. New Positive Semidefinite Relaxations for Nonconvex Quadratic Programs
  • 19. Interval Analysis Applied to Global Minimization
  • 20. Approximate Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequalities
  • 21. Generating Convex Functions
  • 22. The Method of Moments for Nonconvex Variational Problems
  • 23. A Pivoting-based Heuristic for the Maximum Clique Problem
  • 24. An Analytic Center Self Concordant Cut Method for the Convex Feasibility Problem
  • 25. Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem
  • 26. Supervised Training Using Global Search Methods
  • 27. Learning Rate Adaptation in Stochastic Gradient Descent
  • 28. Improving the Particle Swarm Optimizer by Function Stretching
  • 29. Some Convergence Properties of the Steepest Descent Algorithm Revealed by Renormalisation
  • 30. InteriorPoint Algorithm for Dantzig and Wolfe Decomposition Principle
  • 31. Stochastic Perturbation Methods for Affine Restrictions
  • 32. Directed Derivatives of Convex Compact-Valued Mappings
  • 33. A Perturbed Auxiliary Problem Method for Paramonotone Multivalued Mappings
  • 34. A Note on Random Variational Inequalities and Simple Random Unilateral Boundary Value Problems
  • 35. A Comparison Principle and the Lipschitz Continuity for Minimizers
  • 36. Tunneling and Genetic Algorithms for Global Optimization
  • 37. Convexity and Monotonicity in Global Optimization.