Advances in Convex Analysis and Global Optimization, Vol. 54 Book

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