Skip to main content
Log in

On Absorbing Cycles in Min–Max Digraphs

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We consider smooth finite dimensional optimization problems with a compact, connected feasible set M and objective function f. The basic problem, on which we focus, is: how to get from one local minimum to all the other ones. To this aim we introduce a bipartite digraph Γ as follows. Its nodes are formed by the set of local minima and maxima of f| M , respectively. Given a smooth Riemannian (i.e. variable) metric, there is an arc from a local minimum x to a local maximum y if the ascent (semi-)flow induced by the projected gradients of f connects points from a neighborhood of x with points from a neighborhood of y. The existence of an arc from y to x is defined with the aid of the descent (semi-)flow. Strong connectedness of Γ ensures that, starting from one local minimum, we may reach any other one using ascent and descent trajectories in an alternating way. In case that no inequality constraints are present or active, it is well known that for a generic Riemannian metric the resulting min-max digraph Γ is indeed strongly connected. However, if inequality constraints are active, then there might appear obstructions. In fact, we show that Γ may contain absorbing two-cycles. If one enters such a cycle, one cannot leave it anymore via ascent and descent trajectories. Moreover, the cycles being constructed are stable with respect to small perturbations (in the C1-topology) of the Riemannian metric.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • H.Th. Jongen (1997) ArticleTitleZur Geometrie endlichdimensionaler nichtkonvexer Optimierungsaufgaben International Series of Numerical Mathematics 36 111–136 Occurrence Handle464303

    MathSciNet  Google Scholar 

  • H.Th. Jongen. J. Sprekels (1981) ArticleTitleThe index-k-stabilizing differential equation OR-Spektrum 2 223–225 Occurrence Handle10.1007/BF01721010 Occurrence Handle0472.65057

    Article  MATH  Google Scholar 

  • H.Th. Jongen A. Ruiz Jhones (1999) Nonlinear optimization: On the min-max digraph and global smoothing A. Ioffe S. Reich I. Shafrir (Eds) Calculus of Variations and Differential Equations, Research Notes in Mathematics Series, Vol. 410 Chapman Hall Boca Raton 119–135

    Google Scholar 

  • H.Th. Jongen P. Jonker F. Twilt (2000) Nonlinear Optimization in Finite Dimensions Springer US New York Occurrence Handle0985.90083

    MATH  Google Scholar 

  • H.Th. Jongen O. Stein (2004) Constrained Global Optimization: Adaptive Gradient Flows C.A. Floudas P.M. Pardalos (Eds) Frontiers in Global Optimization, Nonconvex Optimization and Its Applications, (1994), Vol. 74 Springer US New York 223–236

    Google Scholar 

  • Zank, H. (1994), personal communication.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Günzel, H., Jongen, H.T. On Absorbing Cycles in Min–Max Digraphs. J Glob Optim 31, 85–92 (2005). https://doi.org/10.1007/s10898-004-6535-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-004-6535-5

Keywords

Navigation