Differentiable Local Barrier-Penalty Paths

  • C. Grossmann
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 202)

Abstract

Perturbations of Karush-Kuhn-Tucker conditions play an important role for primal-dual interior point methods. Beside the usual logarithmic barrier various further techniques of sequential unconstrained minimization are well known. However other than logarithmic embeddings are rarely studied in connection with Newton path-following methods. A key property that allows to extend the class of methods is the existence of a locally Lipschitz continuous path leading to a primal-dual solution of the KKT-system. In this paper a rather general class of barrier/penalty functions is studied. In particular, under LICQ regularity and strict complementarity assumptions the differentiability of the path generated by any choice of barrier/penalty functions from this class is shown. This way equality as well as inequality constraints can be treated directly without additional transformations. Further, it will be sketched how local convergence of the related Newton path-following methods can be proved without direct applications of self-concordance properties.

keywords

Perturbed KKT-systems general barrier-penalty embedding differentiable path path-following methods interior point methods 

References

  1. [1]
    A. Auslender, R. Cominetti, M. Haddou. Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Open Res. 22:43–62, 1997.MATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    A. Forsgren, P.E. Gill, M.H. Wright. Interior methods for nonlinear optimization. SIAM Review 44:525–597, 2002.MATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    A.V. Fiacco, G.P. McCormick. Nonlinear programming: Sequential unconstrained minimization techniques, Wiley, New York, 1968.MATHGoogle Scholar
  4. [4]
    C. Grossmann, Penalty/Barrier path-following in linearly constrained optimization. Discussiones Mathematicae, Differential Inclusions, Control and Optimization 20:7–26, 2000.MATHMathSciNetGoogle Scholar
  5. [5]
    C. Grossmann, M. Zadlo. General primal-dual barrier-penalty path-following Newton methods for nonlinear programming. TU Dresden, Preprint TUD-NM-10-03, 2003 (to appear in Optimization)Google Scholar
  6. [6]
    C. Grossmann, D. Klatte, B. Kummer. Convergence of primal-dual solutions for the non-convex log-barrier method without LICQ. Kybernetika 40: 571–584, 2004.MathSciNetGoogle Scholar
  7. [7]
    D. Klatte, B. Kummer. Nonsmooth equations in optimization — regularity, calculus, methods and applications. Kluwer, Dordrecht, 2002.MATHGoogle Scholar
  8. [8]
    Y. Nesterov, A. Nemirovskii. Interior-point polynomial algorithms in convex programming, SIAM Publications, Philadelphia, 1994.MATHGoogle Scholar
  9. [9]
    S.J. Wright. Primal-Dual Interior-Point Methods. SIAM Publications, Philadelphia, 1997.MATHGoogle Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • C. Grossmann
    • 1
  1. 1.Institut für Numerische MathematikTU DresdenDresdenGermany

Personalised recommendations