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.
Paper written with financial support of DFG grant GR 1777/2-2.
Chapter PDF
Similar content being viewed by others
keywords
References
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.
A. Forsgren, P.E. Gill, M.H. Wright. Interior methods for nonlinear optimization. SIAM Review 44:525–597, 2002.
A.V. Fiacco, G.P. McCormick. Nonlinear programming: Sequential unconstrained minimization techniques, Wiley, New York, 1968.
C. Grossmann, Penalty/Barrier path-following in linearly constrained optimization. Discussiones Mathematicae, Differential Inclusions, Control and Optimization 20:7–26, 2000.
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)
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.
D. Klatte, B. Kummer. Nonsmooth equations in optimization — regularity, calculus, methods and applications. Kluwer, Dordrecht, 2002.
Y. Nesterov, A. Nemirovskii. Interior-point polynomial algorithms in convex programming, SIAM Publications, Philadelphia, 1994.
S.J. Wright. Primal-Dual Interior-Point Methods. SIAM Publications, Philadelphia, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Grossmann, C. (2006). Differentiable Local Barrier-Penalty Paths. In: Ceragioli, F., Dontchev, A., Furuta, H., Marti, K., Pandolfi, L. (eds) Systems, Control, Modeling and Optimization. CSMO 2005. IFIP International Federation for Information Processing, vol 202. Springer, Boston, MA . https://doi.org/10.1007/0-387-33882-9_18
Download citation
DOI: https://doi.org/10.1007/0-387-33882-9_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33881-1
Online ISBN: 978-0-387-33882-8
eBook Packages: Computer ScienceComputer Science (R0)