piwik-script

English Intern
  • Fachbücher im Regal
Numerische Mathematik und Optimierung

Publikationen

Die vollständige Publikationsliste von Prof. Dr. Christian Kanzow und seiner Forschungsgruppe finden Sie auf den jeweiligen persönlichen Webseiten:


Vollständige Publikationsliste

Bücher

 

Buchcover          Buchcover          Buchcover          Buchcover


 

Zeitschriftenartikel

  • 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 )

  • 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 )

  • 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 )

  • Anna von Heusinger und Christian Kanzow
    SC1 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 )

  • 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 )

  • 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 )

  • 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.

  • 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.

  • 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 )

  • 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.

  • 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.

  • 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 2nd 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.

  • 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 )

  • 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 )

  • 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 )

  • 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 )

  • 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.

  • 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.

  • 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.