Publikationen

• Alle anzeigen
• Alle verbergen

2023

• Christian Kanzow und Matteo Lapucci
  Inexact Penalty Decomposition Methods for Optimization Problems with Geometric Constraints
  Computational Optimization and Applicatiions, to appear (Preprint)

• Alberto De Marchi, Xiaoxi Jia, Christian Kanzow und Patrick Mehlitz
  Constrained Structured Optimization and Augmented Lagrangian Proximal Methods
  Mathematical Programming, to appear (Preprint)

2022

• Christian Kanzow und Patrick Mehlitz
  Convergence Properties of Monotone and Nonmonotone Proximal Gradient Methods Revisited.
  Journal of Optimization Theory and Applications, 2022 (DOI: 10.1007/s10957-022-02101-3) (Preprint) (BibTeX)

• Xiaoxi Jia, Christian Kanzow, Patrick Mehlitz und Gerd Wachsmuth
  An Augmented Lagrangian Method for Optimization Problems with Structured Geometric Constraints.
  Mathematical Programming, 2022 (DOI: 10.1007/s10107-022-01870-z) (Preprint) (BibTeX)

• Christian Kanzow und Daniel Steck
  Regularization of Limited Memory Quasi-Newton Methods for Large-Scale Nonconvex Minimization
  Mathematical Programming Computation, to appear (BibTeX)

2021

• Christian Kanzow, Andreas B. Raharja, und Alexandra Schwartz
  Sequential Optimality Conditions for Cardinality-Constrained Optimization Problems with Applications.
  Computational Optimization and Applications 80, 2021, pp. 185–211, (DOI: 10.1007/s10589-021-00298-z) (Preprint) (BibTeX)

• Christian Kanzow, Andreas B. Raharja, und Alexandra Schwartz
  An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems.
  Journal of Optimization Theory and Applications 189, 2021, pp. 793–813 (2021), (DOI: 10.1007/s10957-021-01854-7) (Preprint) (BibTeX)

• Christian Kanzow und Theresa Lechner
  Globalized Inexact Proximal Newton-type Methods for Nonconvex Composite Functions.
  Computational Optimization and Applications 78, 2021, pp. 377-410, (DOI: 10.1007/s10589-020-00243-6) (Preprint) (BibTeX)

• Christian Kanzow, Patrick Mehlitz und Daniel Steck
  Relaxation schemes for mathematical programs with switching constraints.
  Optimization Methods and Software 36, 2021, pp. 1223 - 1258, (DOI: 10.1080/10556788.2019.1663425) (Preprint) (BibTeX)

2020

• Eike Börgens und Christian Kanzow
  ADMM-type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces.
  SIAM Journal on Optimization 31(1), 2020, pp. 377–403 (DOI: 10.1137/19M1284336) (Preprint) (BibTeX)

• Eike Börgens, Christian Kanzow, Patrick Mehlitz, und Gerd Wachsmuth
  New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions.
  SIAM Journal on Control and Optimization 30 (4), 2020, pp. 2956 - 2982 (DOI: 10.1137/19M1306804) (Preprint) (BibTeX)

2019

• Christian Kanzow und Daniel Steck
  Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods.
  SIAM Journal on Optimization 29 (4), 2019, pp. 3174 - 3200 (DOI: 10.1137/18M1230475) (Preprint) (BibTeX)

• Eike Börgens, Christian Kanzow, und Daniel Steck
  Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces.
  SIAM Journal on Control and Optimization 57 (6), 2019, pp. 3694–3722 (DOI: 10.1137/19M1240186 (Preprint) ( BibTeX )

• Christian Kanzow, Veronika Karl, Daniel Steck und Daniel Wachsmuth
  The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces.
  SIAM Journal on Optimization 29 (1), 2019, pp. 767 - 793  (DOI: 10.1137/17M114114X) ( Preprint ) ( BibTeX )
   
• Eike Börgens und Christian Kanzow
  Regularized Jacobi-type ADMM-Methods for a Class of Separable Convex Optimization Problems in Hilbert Spaces.
  Computational Optimization and Applications 73 (3), 2019, pp. 755 - 790 (DOI:  10.1007/s10589-019-00087-9) (Preprint) ( BibTeX )
   
• Christian Kanzow und Daniel Steck
  Improved Local Convergence Results for Augmented Lagrangian Methods in C²-Cone Reducible Constrained Optimization.
  Mathematical Programming, 177 (1-2), 2019, pp. 425 - 438 ( Preprint ) ( BibTeX )

2018

• Christian Kanzow und Daniel Steck
  On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces.
  SIAM Journal on Control and Optimization 56 (3), 2018, pp. 1716 - 1738 (DOI: 10.1137/17M1146518) ( Preprint ) ( BibTeX )
   
• Eike Börgens und Christian Kanzow
  A Distributed Regularized Jacobi-type ADMM-Method for Generalized Nash Equilibrium Problems in Hilbert Spaces.
  Numerical Functional Analysis and Optimization 39 (12), 2018, pp. 1316 - 1349 (DOI: 10.1080/01630563.2018.1477800) (Preprint not available since it is identical to the accepted version) ( BibTeX )
   
• Christian Kanzow, Daniel Steck und Daniel Wachsmuth
  An Augmented Lagrangian Method for Optimization Problems in Banach Spaces.
  SIAM Journal on Control and Optimization 56 (1), 2018, pp. 272 - 291 (DOI: 10.1137/16M1107103) ( Preprint ; note that the accepted version contains a few corrections) ( BibTeX )
   
• Christian Kanzow und Daniel Steck
  Augmented Lagrangian and Exact Penalty Methods for Quasi-Variational Inequalities.
  Computational Optimization and Applications 69 (3), 2018, pp. 801 - 824 (DOI: 10.1007/s10589-017-9963-0) ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Yekini Shehu
  Strong Convergence of a Double Projection-type Method for Monotone Variational Inequalities in Hilbert Spaces.
  Journal of Fixed Point Theory and Applications 20:51, 2018 (24 pages) (DOI: 10.1007/s11784-018-0531-8) ( Preprint ) ( BibTeX )
   
• Leonardo Galli, Christian Kanzow und Marco Sciandrone
  A Nonmonotone Trust-Region Method for Generalized Nash Equilibrium Problems with Strong Convergence Properties.
  Computational Optimization and Applications 69, 2018, pp. 629 - 652 (DOI: 10.1007/s10589-017-9960-3) ( Preprint ) ( BibTeX )

2017

• Christian Kanzow und Daniel Steck
  An Example Comparing the Standard and Safeguarded Augmented Lagrangian Methods.
  Operations Research Letters 45 (6), 2017, 598 - 603 (DOI: 10.1016/j.orl.2017.09.005) ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Daniel Steck
  A Generalized Proximal-Point Method for Convex Optimization Problems in Hilbert Spaces.
  Optimization 66 (10), 2017, 1667 - 1676 (DOI: 10.1080/02331934.2017.1349127) ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Yekini Shehu
  Generalized Krasnoselskii-Mann-type Iterations for Nonexpansive Mappings in Hilbert Spaces.
  Computational Optimization and Applications 67 (3), 2017, pp. 595-620 (DOI: 10.1007/s10589-017-9902-0) ( Preprint ) ( BibTeX )

2016

• Christian Kanzow und Daniel Steck
  Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems.
  SIAM Journal on Optimization 26 (4), 2016, pp. 2034-2058 (DOI: 10.1137/16M1068256) ( Preprint ) ( BibTeX )
   
• Simone Görner und Christian Kanzow
  On Newton's Method for the Fermat-Weber Location Problem.
  Journal of Optimization Theory and Applications 170 (1), 2016, pp. 107-118 (DOI: 10.1007/s10957-016-0946-6) ( Preprint ) ( BibTeX )
   
• Michal Červinka, Christian Kanzow und Alexandra Schwartz
  Constraint Qualifications and Optimality Conditions of Cardinality-Constrained Optimization Problems.
  Mathematical Programming 160 (1), 2016, pp. 353-377 (DOI: 10.1007/s10107-016-0986-6) ( Preprint ) ( BibTeX )
   
• Christian Kanzow
  On the Multiplier-Penalty-Approach for Quasi-Variational Inequalities.
  Mathematical Programming 160 (1), 2016, pp. 33-63 (DOI: 10.1007/s10107-015-0973-3) ( Preprint ) ( BibTeX )
   
• Oleg P. Burdakov, Christian Kanzow und Alexandra Schwartz:
  Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-type Constraints and a Regularization Method.
  SIAM Journal on Optimization 26 (1), 2016, pp. 397-425 (DOI: 10.1137/140978077) ( Preprint ) ( BibTeX )

2015

• Francisco Facchinei, Christian Kanzow, Sebastian Karl und Simone Sagratella:
  The Semismooth Newton Method for the Solution of Quasi-Variational Inequalities.
  Computational Optimization and Applications 62 (1), 2015, pp. 85-109 ( Preprint ) ( BibTeX )
   
• Nadja Harms, Tim Hoheisel und Christian Kanzow
  On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems.
  Journal of Optimization Theory and Applications 166, 2015, pp. 659-685 ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Alexandra Schwartz:
  The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Equilibrium Constraints Revisited.
  Mathematics of Operations Research 40, 2015, pp. 253-275 ( Preprint ) ( BibTeX )
   
• Nadja Harms, Christian Kanzow und Oliver Stein
  On Differentiability Properties of Player Convex Generalized Nash Equilibrium Problems.
  Optimization 64, 2015, pp. 365-388 ( Preprint ) ( BibTeX )

2014

• Nadja Harms, Tim Hoheisel und Christian Kanzow
  On a Smooth Dual Gap Function for a Class of Quasi-Variational Inequalities.
  Journal of Optimization Theory and Applications 163, 2014, pp. 413-438 ( Preprint ) ( BibTeX )
   
• Jörg Franke, Christian Kanzow, Wolfgang Leininger und Alexandra Schwartz
  Lottery versus All-Pay Auction Contests: A Revenue Dominance Theorem.
  Games and Economic Behavior 83, 2014, pp. 116-126 ( Preprint ) ( BibTeX )
   
• Nadja Harms, Christian Kanzow und Oliver Stein
  Smoothness Properties of a Regularized Gap Function for Quasi-Variational Inequalities.
  Optimization Methods and Software 29, 2014, pp. 720-750 ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Alexandra Schwartz
  Convergence Properties of the Inexact Lin-Fukushima Relaxation Method for Mathematical Programs with Equilibrium Constraints.
  Computational Optimization and Applications 59, 2014, pp. 249-262 ( Preprint ) ( BibTeX )
   
• Francisco Facchinei, Christian Kanzow und Simone Sagratella
  Solving Quasi-Variational Inequalities via their KKT-Conditions.
  Mathematical Programming 144, 2014, pp. 369-412 ( Preprint ) ( BibTeX )

2013

• Christian Kanzow und Alexandra Schwartz
  A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties.
  SIAM Journal on Optimization 23, 2013, pp. 770-798. ( Preprint ) ( BibTeX )
   
• Wolfgang Achtziger, Tim Hoheisel und Christian Kanzow
  A Smoothing-Regularization Approach to Mathematical Programs with Vanishing Constraints.
  Computational Optimization and Applications 55, 2013, pp. 733-767. ( BibTeX )
   
• Francisco Facchinei, Christian Kanzow und Simone Sagratella
  QVILIB: A Library of Quasi-Variational Inequality Test Problems.
  Pacific Journal of Optimization 9, 2013, pp. 225-250. ( Preprint ) ( BibTeX )
   
• Alfio Borzi und Christian Kanzow
  Formulation and Numerical Solution of Nash Equilibrium Multiobjective Elliptic Control Problems.
  SIAM Journal on Control and Optimization 51, 2013, pp. 718-744 ( Preprint ) ( BibTeX )
   
• Axel Dreves, Anna von Heusinger, Christian Kanzow und Masao Fukushima
  A Globalized Newton Method for the Computation of Normalized Nash Equilibria.
  Journal of Global Optimization 56, 2013, pp. 327-340 ( Preprint ) ( BibTeX )
   
• James V. Burke, Tim Hoheisel und Christian Kanzow
  Gradient Consistency for Integral-Convolution Smoothing Functions.
  Set-Valued and Variational Analysis 21, 2013, pp. 359-376 ( Preprint ) ( BibTeX )
   
• Tim Hoheisel, Christian Kanzow und Alexandra Schwartz
  Theoretical and Numerical Comparison of Relaxation Methods for Mathematical Programs with Complementarity Constraints.
  Mathematical Programming 137, 2013, pp. 257-288 ( Preprint ) ( BibTeX )
   
• Jörg Franke, Christian Kanzow, Wolfgang Leininger und Alexandra Schwartz
  Effort Maximization in Asymmetric Contest Games with Heterogeneous Contestants.
  Economic Theory 52, 2013, pp. 589-630 ( Preprint )  ( BibTeX ) (note that the published paper is a significant improvement of the preprint version).

2012

• Michael Brückner, Christian Kanzow und Tobias Scheffer
  Static Prediction Games for Adversarial Learning Problems.
  Journal of Machine Learning Research 13, 2012, pp. 2617-2654 ( Preprint ) ( BibTeX )
   
• Tim Hoheisel, Christian Kanzow und Alexandra Schwartz
  Mathematical Programs with Vanishing Constraints: A New Regularization Approach with Strong Convergence Properties.
  Optimization 61, 2012, pp. 619-636 ( Preprint ) ( BibTeX )
   
• Wolfgang Achtziger, Christian Kanzow  und Tim Hoheisel
  On a relaxation method for mathematical programs with vanishing constraints.
  GAMM-Mitteilungen 35, 2012, pp. 110-130. ( BibTeX )
   
• Axel Dreves, Christian Kanzow und Oliver Stein
  Nonsmooth Optimization Reformulations of Player Convex Generalized Nash Equilibrium Problems.
  Journal of Global Optimization 53, 2012, pp. 587-614 ( Preprint ) ( BibTeX )
   
• Anna von Heusinger, Christian Kanzow und Masao Fukushima
  Newton's Method for Computing a Normalized Equilibrium in the Generalized Nash Game through Fixed Point Formulation.
  Mathematical Programming 132, 2012, pp. 99-123. ( Preprint ) ( BibTeX )
   
• Tim Hoheisel, Christian Kanzow und Alexandra Schwartz
  Convergence of a Local Regularization Approach for Mathematical Programs with Complementarity or Vanishing Constraints.
  Optimization Methods and Software 27, 2012, pp. 483-512. ( Preprint ) ( BibTeX )
   
• Hannes Buchholzer und Christian Kanzow
  Bounds for the Extremal Eigenvalues of a Class of Symmetric Tridiagonal Matrices with Applications.
  Linear Algebra and its Applications 436, 2012, pp. 1837-1849 ( Preprint ) ( BibTeX )
   
• Tim Hoheisel, Christian Kanzow, Boris S. Mordukhovich und Hung Phan
  Generalized Newton's Method Based on the Graphical Derivative.
  Nonlinear Analysis: Theory, Methods, and Applications 75, 2012, pp. 1324-1340. ( Preprint ) ( BibTeX )

2011

• Axel Dreves, Francisco Facchinei, Christian Kanzow und Simone Sagratella
  On the Solution of the KKT Conditions of Generalized Nash Equilibrium Problems.
  SIAM Journal on Optimization 21, 2011, pp. 1082-1108. ( Preprint ) ( BibTeX )
   
• Hannes Buchholzer, Christian Kanzow, Peter Knabner und Serge Kräutle
  Solution of Reactive Transport Problems Including Mineral Precipitation-Dissolution Reactions by a Semismooth Newton Method.
  Computational Optimization and Applications 50, 2011, pp. 193-221. ( Preprint ) ( BibTeX )
   
• Tim Hoheisel, Christian Kanzow und Alexandra Schwartz
  Improved Convergence Properties of the Lin-Fukushima-Regularization Method for Mathematical Programs with Complementarity Constraints.
  Numerical Algebra, Control, and Optimization 1, 2011, 49-60 ( Preprint ) ( BibTeX )
   
• Axel Dreves und Christian Kanzow
  Nonsmooth Optimization Reformulations Characterizing all Solutions of Jointly Convex Generalized Nash Equilibrium Problems.
  Computational Optimization and Applications 50, 2011, 23-48. ( Preprint ) ( BibTeX )

2010

• Christian Kanzow und Alexandra Schwartz
  Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-Conditions, New Constraint Qualifications and Improved Exact Penalty Results.
  SIAM Journal on Optimization 20, 2010, 2730-2753. ( Preprint ) ( BibTeX )
   
• Francisco Facchinei und Christian Kanzow
  Penalty Methods for the Solution of Generalized Nash Equilibrium Problems.
  SIAM Journal on Optimization 20, 2010, 2228-2253. Preprint (including a detailed description of all test examples which are not published in the SIOPT paper) ( BibTeX )
   
• Tim Hoheisel, Christian Kanzow und Jiri V. Outrata
  Exact Penalty Results for Mathematical Programs with Vanishing Constraints.
  Nonlinear Analysis: Theory, Methods, and Applications 72, 2010, 2514-2526. ( Preprint ) ( BibTeX )
   
• Francisco Facchinei und Christian Kanzow
  Generalized Nash Equilibrium Problems.
  Annals of Operations Research 175, 2010, 177-211 ( Preprint ) (this is an updated version of the survey paper that appeared in 4OR, 5 (3), 173-210 (2007)). ( BibTeX )

2009

• Christian Kanzow, Izabella Ferenczi und Masao Fukushima
  On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity.
  SIAM Journal on Optimization 20, 2009, 297-320. ( Preprint ) ( BibTeX )
   
• Anna von Heusinger und Christian Kanzow
  Relaxation Methods for Generalized Nash Equilibrium Problems with Inexact Line Search.
  Journal of Optimization Theory and Applications 143, 2009, 159-183. ( Preprint ) ( BibTeX )
   
• Anna von Heusinger und Christian Kanzow
  Optimization Reformulations of the Generalized Nash Equilibrium Problem Using Nikaido-Isoda-Type Functions.
  Computational Optimization and Applications 43, 2009, pp. 353-377. ( Preprint ) ( BibTeX )
   
• Tim Hoheisel und Christian Kanzow
  On the Abadie and Guignard Constraint Qualifications for Mathematical Programmes with Vanishing Constraints.
  Optimization 58, 2009, pp. 431-448. ( Preprint ) ( BibTeX )

2008

• Anna von Heusinger und Christian Kanzow
  SC¹ Optimization Reformulations of the Generalized Nash Equilibrium Problem.
  Optimization Methods and Software 23, 2008, pp. 953-973 ( Preprint ) ( BibTeX )
   
• Amir Beck, Aharon Ben-Tal und Christian Kanzow
  A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring.
  SIAM Journal on Matrix Analysis and Applications 30, 2008, pp. 419-443 ( Preprint ) ( BibTeX )
   
• Wolfgang Achtziger und Christian Kanzow
  Mathematical Programs with Vanishing Constraints: Optimality Conditions and Constraint Qualifications.
  Mathematical Programming 114, 2008, pp. 69-99. ( Preprint ) ( BibTeX )
   
• Tim Hoheisel und Christian Kanzow
  Stationary Conditions for Mathematical Programs with Vanishing Constraints Using Weak Constraint Qualifications.
  Journal of Mathematical Analysis and Applications 337, 2008, pp. 292-310. ( Preprint ) ( BibTeX )

2007

• Tim Hoheisel und Christian Kanzow
  First- and Second-Order Optimality Conditions for Mathematical Programs with Vanishing Constraints.
  Applications of Mathematics 52, 2007, pp. 495-514 (special issue dedicated to J.V. Outrata's 60. birthday) ( Preprint ) ( BibTeX )
   
• Francisco Facchinei und Christian Kanzow
  Generalized Nash Equilibrium Problems.
  4OR - A Quarterly Journal of Operations Research 5, 2007, pp. 173-210. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Stefania Petra
  Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems.
  Optimization Methods and Software 22, 2007, pp. 713-735. ( Preprint ) ( BibTeX )
   
• Michael L. Flegel und Christian Kanzow
  Equivalence of two nondegeneracy conditions for semidefinite programs.
  Journal of Optimization Theory and Applications 135, 2007, pp. 381-397. ( Preprint ) ( BibTeX )
   
• Michael L. Flegel, Christian Kanzow und Jiri V. Outrata
  Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints.
  Set-Valued Analysis 15, 2007, pp. 139-162. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Andreas Klug
  An interior-point affine-scaling trust-region method for semismooth equations with box constraints.
  Computational Optimization and Applications 37, 2007, pp. 329-353. ( Preprint ) ( BibTeX )

2006

• Christian Kanzow und Andreas Klug
  On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints.
  Computational Optimization and Applications 35, 2006, pp. 177-197. ( Preprint ) ( BibTeX )

2005

• Michael L. Flegel und Christian Kanzow
  On the Guignard constraint qualification for mathematical programs with equilibrium constraints.
  Optimization 54, 2005, pp. 517-534. ( Preprint ) ( BibTeX )
   
• Michael L. Flegel und Christian Kanzow
  On M-stationary points for mathematical programs with equilibrium constraints.
  Journal of Mathematical Analysis and Applications 310, 2005, pp. 286-302. ( Preprint ) ( BibTeX )
   
• Christian Kanzow, Christian Nagel, Hirokazu Kato und Masao Fukushima
  Successive linearization methods for nonlinear semidefinite programs.
  Computational Optimization and Applications 31, 2005, pp. 251-273. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Christian Nagel
  Quadratic convergence of a Newton-type method for semidefinite programs without strict complementarity.
  SIAM Journal on Optimization 15, 2005, pp. 654-672. ( Preprint ) ( BibTeX )
   
• Michael L. Flegel und Christian Kanzow
  Abadie-type constraint qualification for mathematical programs with equilibrium constraints.
  Journal of Optimization Theory and Applications 124, 2005, pp. 595-614. ( Preprint ) ( BibTeX )
   
• K. Schittkowski, Ch. Zillober
  Nonlinear programming: algorithms, software, and applications.
  In: System Modeling and Optimization, edited by J. Cagnol and J.-P. Zalesio, Kluwer, pp. 73-108, 2005.
   
• K. Schittkowski, Ch. Zillober
  SQP versus SCP methods for nonlinear programming.
  In: Optimization and Control with Applications, edited by Qi, Teo and Yang, Springer, pp. 305-330, 2005.
   
• Q. Ni, Ch. Zillober, K. Schittkowski
  Sequential convex programming methods for solving large topology optimization problems: implementation and computational results.
  Journal of Computational Mathematics, Vol. 23, No. 5, pp. 491-502, 2005.

2004

• Christian Kanzow, Nobuo Yamashita und Masao Fukushima
  Levenberg-Marquardt methods for constrained nonlinear equations with strong local convergence properties.
  Journal of Computational and Applied Mathematics 172, 2004, pp. 375-397. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Stefania Petra
  On a semismooth least squares formulation of complementarity problems with gap reduction.
  Optimization Methods and Software 19, 2004, pp. 507-525. ( Preprint ) ( BibTeX )

• Christian Kanzow and Christian Nagel
  Some structural properties of a Newton-type method for semidefinite programs.
  Journal of Optimization Theory and Applications 122, 2004, pp. 219-226. ( Preprint ) ( BibTeX )
   
• Christian Kanzow
  Inexact semismooth Newton methods for large-scale complementarity problems.
  Optimization Methods and Software 19, 2004, pp. 309-325. ( Preprint ) ( BibTeX )
   
• Ch. Zillober, K. Schittkowski, K. Moritzen
  Very large scale optimization by sequential convex programming.
  Optimization Methods and Software, Vol. 19, No. 1, pp. 103-120, 2004.

2003

• Michael L. Flegel und Christian Kanzow
  A Fritz John approach to first order optimality conditions for mathematical programs with equilibrium constraints.
  Optimization 52, 2003, pp. 277-286. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Christian Nagel
  Semidefinite programs: New search directions, smoothing-type methods, and numerical results.
  SIAM Journal on Optimization 13, 2003, pp. 1-23 ( Preprint ) ( BibTeX ) (Erratum in SIAM Journal on Optimization 14, 2004, pp. 936-937 ( Preprint )).
   
• Christian Kanzow, Houduo Qi und Liqun Qi
  On the minimum norm solution of linear programs.
  Journal of Optimization Theory and Applications 116, 2003, pp. 333-345. ( Preprint ) ( BibTeX )

2002

• Stephan Engelke und Christian Kanzow
  Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter.
  Computational Optimization and Applications 23, 2002, pp. 299-320. ( Preprint ) ( BibTeX )
   
• Stephan Engelke und Christian Kanzow
  Improved smoothing-type methods for the solution of linear programs.
  Numerische Mathematik 90, 2002, pp. 487-507. ( Preprint ) ( BibTeX )
   
• Ch. Zillober
  On the solution of large engineering design problems via mathematical programming.
  Proceedings in Applied Mathematics and Mechanics (PAMM), Wiley, Vol. 1 (1), pp. 480-481, 2002.
   
• K. Schittkowski, Ch. Zillober
  Nonlinear Programming.
  Encyclopedia of Life Support Systems, UNESCO, Topic: Fundamentals of Optimization and Operations Research, pp. 157-177, 2002.
   
• Ch. Zillober
  SCPIP - an efficient software tool for the solution of structural optimization problems.
  Structural and Multidisciplinary Optimization, Vol. 24, No. 5, pp. 362-371, 2002.

2001

• Todd S. Munson, Francisco Facchinei, Michael C. Ferris, Andreas Fischer und Christian Kanzow
  The semismooth algorithm for large scale complementarity problems.
  INFORMS Journal on Computing 13, 2001, pp. 294-311. ( Preprint ) ( BibTeX )
   
• Nobuo Yamashita, Christian Kanzow, Tomoyuki Morimoto und Masao Fukushima
  An infeasible interior proximal method for convex programming problems with linear constraints.
  Journal of Nonlinear and Convex Analysis 2, 2001, pp. 139-156. ( Preprint ) ( BibTeX )
   
• Christian Kanzow
  Strictly feasible equation-based methods for mixed complementarity problems.
  Numerische Mathematik 89, 2001, pp. 135-160. ( Preprint ) ( BibTeX )
   
• Stephan Engelke und Christian Kanzow
  On the solution of linear programs by Jacobian smoothing methods.
  Annals of Operations Research 103, 2001, pp. 49-70. ( Preprint ) ( BibTeX )
   
• Ch. Zillober
  Convex approximation methods for practical optimization.
  Operations Research Proceedings 2000, edited by B. Fleischmann et al., Springer Verlag, Berlin, Heidelberg, pp. 20-25, 2001.
   
• Ch. Zillober
  Global convergence of a Nonlinear Programming method using convex approximations.
  Numerical Algorithms, Vol. 27, No. 3, pp. 256-289, 2001 (formerly technical report TR99-1).
   
• Ch. Zillober
  A combined convex approximation - interior point approach for large scale Nonlinear Programming.
  Optimization and Engineering, Vol. 2, No. 1, pp. 51-73, 2001 (formerly technical report TR00-1).
   
• Ch. Zillober
  Efficient solution of large mathematical programs arising in engineering design optimization with the method of moving asymptotes.
  Proceedings of the 4th World Congress of Structural and Multidisciplinary Optimization, Dalian/China, edited by G. Cheng et al., Liaoning Electronic Press, 2001.

2000

• Bintong Chen, Xiaojun Chen und Christian Kanzow
  A penalized Fischer-Burmeister NCP-function.
  Mathematical Programming 88, 2000, pp. 211-216. ( Preprint ) ( BibTeX )
   
• Francisco Facchinei, Andreas Fischer und Christian Kanzow
  On the identification of zero variables in an interior-point framework.
  SIAM Journal on Optimization 10, 2000, pp. 1058-1078. ( Preprint , sorry, there is a missing graphic in the preprint) ( BibTeX )
   
• Tecla De Luca, Francisco Facchinei und Christian Kanzow
  A theoretical and numerical comparison of some semismooth algorithms for complementarity problems.
  Computational Optimization and Applications 16, 2000, pp. 173-205. ( Preprint ) ( BibTeX )
   
• Christian Kanzow
  Global optimization techniques for mixed complementarity problems.
  Journal of Global Optimization 16, 2000, pp. 1-21. ( Preprint ) ( BibTeX )
   
• Ch. Zillober, F. Vogel
  Solving large scale structural optimization problems.
  Proceedings of the 2^nd ASMO UK/ISSMO conference on Engineering Design Optimization, Swansea, July 10-11, 2000, pp. 273-280, edited by J. Sienz.
   
• Ch. Zillober, F. Vogel
  Adaptive strategies for large scale optimization problems in mechanical engineering.
  In: Recent Advances in Applied and Theoretical Mathematics, edited by N. Mastorakis, pp. 156-161.
   
• Ch. Zillober
  Stable computation of interior point solutions for a class of nonlinear convex programming problems.
  Advanced Modeling and Optimization 2, pp. 53-69, 2000.

1999

• Michael C. Ferris, Christian Kanzow und Todd S. Munson
  Feasible descent algorithms for mixed complementarity problems.
  Mathematical Programming 86, 1999, pp. 475-497. ( Preprint ) ( BibTeX )
   
• Ji-Ming Peng, Christian Kanzow und Masao Fukushima
  A hybrid Newton method for solving box constrained variational inequality problems via the D-gap function.
  Optimization Methods and Software 10, 1999, pp. 687-710. ( BibTeX )
   
• Christian Kanzow und Heiko Pieper
  Jacobian smoothing methods for nonlinear complementarity problems.
  SIAM Journal on Optimization 9, 1999, pp. 342-372. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Houduo Qi
  A QP-free constrained Newton-type method for variational inequality problems.
  Mathematical Programming 85, 1999, pp. 81-106. ( Preprint ) ( BibTeX )
   
• Francisco Facchinei und Christian Kanzow
  Beyond monotonicity in regularization methods for complementarity problems.
  SIAM Journal on Control and Optimization 37, 1999, pp. 1150-1161. ( Preprint ) ( BibTeX )
   
• Francisco Facchinei, Andreas Fischer, Christian Kanzow und Ji-Ming Peng
  A simply constrained optimization reformulation of KKT systems arising from variational inequalities.
  Applied Mathematics and Optimization 40, 1999, pp. 19-37. ( Preprint ) ( BibTeX )
   
• Francisco Facchinei, Andreas Fischer und Christian Kanzow
  On the accurate identification of active constraints.
  SIAM Journal on Optimization 9, 1999, pp. 14-32. ( Preprint ) ( BibTeX )

1998

• Christian Kanzow und Helmut Kleinmichel
  A new class of semismooth Newton-type methods for nonlinear complementarity problems.
  Computational Optimization and Applications 11, 1998, pp. 227-251. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Masao Fukushima
  Solving box constrained variational inequality problems by using the natural residual with D-gap function globalization.
  Operations Research Letters 23, 1998, pp. 45-51. ( BibTeX )
   
• Christian Kanzow
  An inexact QP-based method for nonlinear complementarity problems.
  Numerische Mathematik 80, 1998, pp. 557-577. ( BibTeX )
   
• Francisco Facchinei, Andreas Fischer und Christian Kanzow
  Regularity properties of a semismooth reformulation of variational inequalities.
  SIAM Journal on Optimization 8, 1998, pp. 850-869. ( Preprint ) ( BibTeX )
   
• Christian Kanzow und Masao Fukushima
  Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities.
  Mathematical Programming 83, 1998, pp. 55-87. ( BibTeX )
   
• Christian Kanzow und Houyuan Jiang
  A continuation method for (strongly) monotone variational inequalities.
  Mathematical Programming 81, 1998, pp. 103-125. ( Preprint ) ( BibTeX )

1997

• Christian Kanzow
  A new approach to continuation methods for complementarity problems with uniform P-functions.
  Operations Research Letters 20, 1997, pp. 85-92. ( Preprint ) ( BibTeX )
   
• Christian Kanzow, Nobuo Yamashita und Masao Fukushima
  New NCP-functions and their properties.
  Journal of Optimization Theory and Applications 94, 1997, pp. 115-135. ( BibTeX )
   
• Francisco Facchinei und Christian Kanzow
  A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems.
  Mathematical Programming 76, 1997, pp. 493-512. ( BibTeX )
   
• Francisco Facchinei und Christian Kanzow
  On unconstrained and constrained stationary points of the implicit Lagrangian.
  Journal of Optimization Theory and Applications 92, 1997, pp. 99-115. ( Preprint ) ( BibTeX )

1996

• Tecla De Luca, Francisco Facchinei und Christian Kanzow
  A semismooth equation approach to the solution of nonlinear complementarity problems.
  Mathematical Programming 75, 1996, pp. 407-439. ( BibTeX )
   
• Andreas Fischer und Christian Kanzow
  On finite termination of an iterative method for linear complementarity problems.
  Mathematical Programming 74, 1996, pp. 279-292. ( Preprint ) ( BibTeX )
   
• Christian Kanzow
  Some noninterior continuation methods for linear complementarity problems.
  SIAM Journal on Matrix Analysis and Applications 17, 1996, pp. 851-868. ( BibTeX )
   
• Christian Kanzow und Masao Fukushima
  Equivalence of the generalized complementarity problem to differentiable unconstrained minimization.
  Journal of Optimization Theory and Applications 90, 1996, pp. 581-603. ( BibTeX )
   
• Carl Geiger und Christian Kanzow
  On the resolution of monotone complementarity problems.
  Computational Optimization and Applications 5, 1996, pp. 155-173. ( Preprint ) ( BibTeX )
   
• Christian Kanzow
  Global convergence properties of some iterative methods for linear complementarity problems.
  SIAM Journal on Optimization 6, 1996, pp. 326-341. ( BibTeX )
   
• Christian Kanzow
  Nonlinear complementarity as unconstrained optimization.
  Journal of Optimization Theory and Applications 88, 1996, pp. 139-155. ( BibTeX )

1995

• Christian Kanzow und Helmut Kleinmichel
  A class of Newton-type methods for equality and inequality constrained optimization.
  Optimization Methods and Software 5, 1995, pp. 173-198. ( BibTeX )
   
• K. Schittkowski, Ch. Zillober
  Sequential convex programming methods.
  Proceedings of the 2nd GAMM/IFIP-workshop on stochastic optimization: numerical methods and technical applications, Munich, June 15-17, 1993, edited by K. Marti et al. Lecture Notes in Economics and Mathematical Systems 423, pp. 123-141, 1995.

1994

• Christian Kanzow
  An unconstrained optimization technique for large-scale linearly constrained convex minimization problems.
  Computing 53, 1994, pp. 101-117. ( BibTeX )
   
• Christian Kanzow
  Some equation-based methods for the nonlinear complementarity problem.
  Optimization Methods and Software 3, 1994, pp. 327-340. ( BibTeX )
   
• K. Schittkowski, Ch. Zillober, R. Zotemantel
  Numerical comparison of Nonlinear Programming algorithms for Structural Optimization.
  Structural Optimization 7 (1994), pp.1-19.

1993

• Ch. Kredler, Ch. Zillober, F. Johannes, G. Sigl
  An application of preconditioned conjugate gradients to relative placement in chip design.
  International Journal for Numerical Methods in Engineering, 36 (1993), pp.255-271.
   
• Ch. Zillober
  A globally convergent version of the method of moving asymptotes.
  Structural Optimization 6 (1993), pp.166-174.
   
• Ch. Zillober
  Sequential convex programming in theory and praxis.
  Structural Optimization 93 - The World Congress on Optimal Design of Structural Systems, Rio de Janeiro, August 2-6, 1993, edited by J. Herskovits, pp. 79-86.