| Preface | |
| Constantin Caratheodory: His Life and Work | |
| Inner Approximation of State-constrained Optimal Control Problems | p. 1 |
| Nonsmooth Problems in Mathematical Diagnostics | p. 11 |
| Deterministic Global Optimization for Protein Structure Prediction | p. 31 |
| Some Remarks on Minimum Principles | p. 75 |
| Transversal Hypergraphs and Families of Polyhedral Cones | p. 105 |
| SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint | p. 119 |
| Convex Analysis in the Calculus of Variations | p. 135 |
| Global Minimization and Parameter Estimation in Computational Biology | p. 153 |
| Lagrangian Quadratic Bounds in Polynomial Nonconvex and Boolean Models with Superfluous Constraints | p. 181 |
| Generalized Duality in Variational Analysis | p. 205 |
| Clustering via D. C. Optimization | p. 221 |
| Algorithms and Merit Functions for the Principal Eigenvalue | p. 235 |
| Modified Versions of the Cutting Angle Method | p. 245 |
| Theoretical and Computational Results for a Linear Bilevel Problem | p. 269 |
| The Lagrangian Search Method | p. 283 |
| An [epsilon]-maximum Principle for Generalized Control Systems | p. 295 |
| D.C. Optimization Approaches via Markov Models for Restoration of Signal (1-D) and (2-D) | p. 303 |
| New Positive Semidefinite Relaxations for Nonconvex Quadratic Programs | p. 319 |
| Interval Analysis Applied to Global Minimization | p. 333 |
| Approximate Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequalities | p. 345 |
| Generating Convex Functions | p. 361 |
| The Method of Moments for Nonconvex Variational Problems | p. 371 |
| A Pivoting-based Heuristic for the Maximum Clique Problem | p. 383 |
| An Analytic Center Self Concordant Cut Method for the Convex Feasibility Problem | p. 395 |
| Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem | p. 409 |
| Supervised Training Using Global Search Methods | p. 421 |
| Learning Rate Adaptation in Stochastic Gradient Descent | p. 433 |
| Improving the Particle Swarm Optimizer by Function "Stretchin | p. 445 |
| Some Convergence Properties of the Steepest Descent Algorithm Revealed by Renormalisation | p. 459 |
| Interior-Point Algorithm for Dantzig and Wolfe Decomposition Principle | p. 473 |
| Stochastic Perturbation Methods for Affine Restrictions | p. 487 |
| Directed Derivatives of Convex Compact-Valued Mappings | p. 501 |
| A Perturbed Auxiliary Problem Method for Paramonotone Multivalued Mappings | p. 515 |
| A Note on Random Variational Inequalities and Simple Random Unilateral Boundary Value Problems | p. 531 |
| Comparison Principle and the Lipschitz Continuity for Minimizers | p. 545 |
| Tunneling and Genetic Algorithms for Global Optimization | p. 553 |
| Convexity and Monotonicity in Global Optimization | p. 569 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
