Skip to main content
SpringerLink
Log in

On the Complexity of Equalizing Inequalities

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

Abstract

We study two approaches to replace a finite mathematical programming problem with inequality constraints by a problem that contains only equality constraints. The first approach lifts the feasible set into a high-dimensional space by the introduction of quadratic slack variables. We show that then not only the number of critical points but also the topological complexity of the feasible set grow exponentially. On the other hand, the second approach bases on an interior point technique and lifts an approximation of the feasible set into a space with only one additional dimension. Here only Karush–Kuhn–Tucker points with respect to the positive and negative objective function in the original problem give rise to critical points of the smoothed problem, so that the number of critical points as well as the topological complexity can at most double.

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

Access this article

Log in via an institution

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

  1. Griffiths P. and Harris J. (1978), Principles of Algebraic Geometry, Wiley, New York.

    Google Scholar 

  2. Guerra Vasquez F., Günzel H. and Jongen H.Th. (2001) On logarithmic smoothing of the maximum function, Annals of Operations Research, 101, 209–220.

    Google Scholar 

  3. Jongen H.Th., Jonker P. and Twilt F. (2000), Nonlinear Optimization in Finite Dimensions, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  4. Jongen H.Th. and Ruiz Jhones A. (1999), Nonlinear optimization: on the min-max digraph and global smoothing, in: Ioffe A., Reich S. and Shafrir I. (eds.): Calculus of Variations and Differential Equations, Chapman & Hall/CRC Research Notes in Mathematics Series, 410, CRC Press, Boca Raton, FL, 119–135.

    Google Scholar 

  5. Jongen H. Th. and Stein O. (2003), Constrained global optimization: adaptive gradient flows, Preprint No. 101, Department of Mathematics-C, Aachen University.

  6. Rapcsák T. (1997), Smooth Nonlinear Optimization in ℝn, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  7. Tanabe K. (1980), A geometric method in nonlinear programming, Journal of Optimization Theory and Applications, 30, 181–210.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics – C, Aachen University, Aachen, Germany

    Hubertus Th. Jongen & Oliver Stein

Authors
  1. Hubertus Th. Jongen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Stein
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jongen, H.T., Stein, O. On the Complexity of Equalizing Inequalities. Journal of Global Optimization 27, 367–374 (2003). https://doi.org/10.1023/A:1026051901133

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026051901133

Search

Navigation