Abstract
We consider finite dimensional smooth optimization problems with a compact and connected feasible set. A basic problem in global optimization is how to get from one local minimum to all other ones by using local ascent or descent directions. In general, these local directions are induced by a Riemannian (i.e. variable) metric. We consider the “bang-bang” strategy of starting at a local minimum, going upward via the ascent flow until a maximum is reached, and then moving downward along the descent flow to a (possibly different) local minimum. Iteration of this procedure gives rise to a bipartite digraph whose nodes are the local minima/maxima.
It is well-known that in absence of inequality constraints this digraph is strongly connected for generic metrics, whereas this might not be the case when inequality constraints are present. In [8] a special global adaptation of the metric, based on global information, is constructed such that the digraph becomes connected. The present article presents an automatic adaptation of the metric based on local information which generically guarantees the desired connectedness.
The theorem is first proved for the special case of a smooth boundary of the feasible set. Then we show how the general case can either be reduced to the special case by logarithmic smoothing, or how it can be treated exactly. The paper ends with a conjecture concerning the replacement of the linear independence constraint qualification and nondegeneracy of certain critical points by the Mangasarian-Fromovitz constraint qualification and strong stability, respectively.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Attouch, X. Goudou, P. Redont (2000), “The heavy ball with friction method, I. The continuous dynamical system: global exploration of the local minima of a real-valued function by asymptotic analysis of a dissipative dynamical system,” Commun. Contemp. Math., Vol. 2, 1–34.
P. Dupuis, A. Nagurney (1993), “Dynamical systems and variational inequalities,” Ann. Oper. Res., Vol. 44, 9–42.
A. O. Griewank (1981), “Generalized descent for global optimization,” J. Optim. Theory Appl., Vol. 34, 11–39.
J. Guddat, H. Th. Jongen, J.-J. Rückmann (1986), “On stability and stationary points in nonlinear optimization,” J. Aust. Math. Soc., Vol. 28 B, 36–56.
F. Guerra Vasquez, H. Günzel, H.Th. Jongen (2001), “On logarithmic smoothing of the maximum function,” Ann. Oper. Res., Vol. 101, 209–220.
H. Günzel, H. Th. Jongen (2002), “On absorbing cycles in min-max digraphs,” Preprint.
H. Th. Jongen, P. Jonker, F. Twilt (2000), “Nonlinear Optimization in Finite Dimensions,” Kluwer, Dordrecht.
H. Th. Jongen, A. Ruiz Jhones (1999), “Nonlinear Optimization: On the min-max digraph and global smoothing,” in: Calculus of Variations and Differential Equations (Eds.: A. Ioffe, S. Reich, I. Shafrir), Chapman & Hall/CRC Research Notes in Mathematics Series, Vol. 410, CRC Press, Boca Raton FL, 119–135.
H. Th. Jongen, O. Stein, “On the complexity of equalizing inequalities,” J. Global Optim., to appear.
M. Kojima (1980), “Strongly stable stationary solutions in nonlinear programs,” in: S.M. Robinson (ed): Analysis and Computation of Fixed Points, Academic Press, New York, 93–138.
T. Rapcsâk (1997), “Smooth Nonlinear Optimization of ℝn,” Kluwer, Dordrecht.
J. Schropp (2000), “A dynamical systems approach to constrained minimization,” Nu-mer. Funct. Anal. and Optimiz., Vol. 21, 537–551.
S. Smale (1961), “On gradient dynamical systems,” Ann. Math., II. Ser. 74, 199–206.
K. Tanabe (1980), “A geometric method in nonlinear programming,” J. Optim. Theory and Appl., Vol. 30, 181–210.
M.J. Todd (1997), “Potential-reduction methods in mathematical programming,” Math. Program., Vol. 76, 3–45.
M.A. Woodbury (1950), “Inverting modified matrices,” Statist. Res. Group, Mem. Rep., No. 42, Princeton University, Princeton, N.J.
H. Zank (1994), Personal communication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Jongen, H.T., Stein, O. (2004). Constrained Global Optimization: Adaptive Gradient Flows. In: Floudas, C.A., Pardalos, P. (eds) Frontiers in Global Optimization. Nonconvex Optimization and Its Applications, vol 74. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0251-3_12
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0251-3_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7961-4
Online ISBN: 978-1-4613-0251-3
eBook Packages: Springer Book Archive