An unconstrained optimization technique for large-scale linearly constrained convex minimization problems. - Christian Kanzow (Computing, 1994)

On the resolution of monotone complementarity problems. - Carl Geiger; Christian Kanzow (Comput. Optim. Appl., 1996)

A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. - Francisco Facchinei; Christian Kanzow (Math. Program., 1996)

On finite termination of an iterative method for linear complementarity problems. - Andreas Fischer 004; Christian Kanzow (Math. Program., 1996)

A semismooth equation approach to the solution of nonlinear complementarity problems. - Tecla De Luca; Francisco Facchinei; Christian Kanzow (Math. Program., 1996)

Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems. - Christian Kanzow (SIAM J. Optim., 1996)

Some Noninterior Continuation Methods for Linear Complementarity Problems. - Christian Kanzow (SIAM J. Matrix Anal. Appl., 1996)

A new approach to continuation methods for complementarity problems with uniform P-functions. - Christian Kanzow (Oper. Res. Lett., 1997)

A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems. - Christian Kanzow; Helmut Kleinmichel (Comput. Optim. Appl., 1998)

Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities. - Christian Kanzow; Masao Fukushima (Math. Program., 1998)

A continuation method for (strongly) monotone variational inequalities. - Christian Kanzow; Houyuan Jiang (Math. Program., 1998)

An inexactQP-based method for nonlinear complementarity problems. - Christian Kanzow (Numerische Mathematik, 1998)

Solving box constrained variational inequalities by using the natural residual with D-gap function globalization. - Christian Kanzow; Masao Fukushima (Oper. Res. Lett., 1998)

On the Accurate Identification of Active Constraints. - Francisco Facchinei; Andreas Fischer 004; Christian Kanzow (SIAM J. Optim., 1998)

Regularity Properties of a Semismooth Reformulation of Variational Inequalities. - Francisco Facchinei; Andreas Fischer 004; Christian Kanzow (SIAM J. Optim., 1998)

Feasible descent algorithms for mixed complementarity problems. - Michael C. Ferris; Christian Kanzow; Todd S. Munson (Math. Program., 1999)

A QP-free constrained Newton-type method for variational inequality problems. - Christian Kanzow; Houduo Qi (Math. Program., 1999)

Jacobian Smoothing Methods for Nonlinear Complementarity Problems. - Christian Kanzow; Heiko Pieper (SIAM J. Optim., 1999)

A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems. - Tecla De Luca; Francisco Facchinei; Christian Kanzow (Comput. Optim. Appl., 2000)

Global Optimization Techniques for Mixed Complementarity Problems. - Christian Kanzow (J. Glob. Optim., 2000)

A penalized Fischer-Burmeister NCP-function. - Bintong Chen; Xiaojun Chen 001; Christian Kanzow (Math. Program., 2000)

On the Identification of Zero Variables in an Interior-Point Framework. - Francisco Facchinei; Andreas Fischer 004; Christian Kanzow (SIAM J. Optim., 2000)

On the Solution of Linear Programs by Jacobian Smoothing Methods. - Stephan Engelke; Christian Kanzow (Ann. Oper. Res., 2001)

The Semismooth Algorithm for Large Scale Complementarity Problems. - Todd S. Munson; Francisco Facchinei; Michael C. Ferris; Andreas Fischer 004; Christian Kanzow (INFORMS J. Comput., 2001)

Strictly feasible equation-based methods for mixed complementarity problems. - Christian Kanzow (Numerische Mathematik, 2001)

Predictor-Corrector Smoothing Methods for Linear Programs with a More Flexible Update of the Smoothing Parameter. - Stephan Engelke; Christian Kanzow (Comput. Optim. Appl., 2002)

Improved smoothing-type methods for the solution of linear programs. - Stephan Engelke; Christian Kanzow (Numerische Mathematik, 2002)

Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results. - Christian Kanzow; Christian Nagel (SIAM J. Optim., 2002)

Inexact semismooth Newton methods for large-scale complementarity problems. - Christian Kanzow (Optim. Methods Softw., 2004)

On a semismooth least squares formulation of complementarity problems with gap reduction. - Christian Kanzow; Stefania Petra (Optim. Methods Softw., 2004)

Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results. - Christian Kanzow; Christian Nagel (SIAM J. Optim., 2004)

Successive Linearization Methods for Nonlinear Semidefinite Programs. - Christian Kanzow; Christian Nagel; Hirokazu Kato 002; Masao Fukushima (Comput. Optim. Appl., 2005)

Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity. - Christian Kanzow; Christian Nagel (SIAM J. Optim., 2005)

On Affine-Scaling Interior-Point Newton Methods for Nonlinear Minimization with Bound Constraints. - Christian Kanzow; Andreas Klug (Comput. Optim. Appl., 2006)

Generalized Nash equilibrium problems. - Francisco Facchinei; Christian Kanzow (4OR, 2007)

An interior-point affine-scaling trust-region method for semismooth equations with box constraints. - Christian Kanzow; Andreas Klug (Comput. Optim. Appl., 2007)

Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems. - Christian Kanzow; Stefania Petra (Optim. Methods Softw., 2007)

Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications. - Wolfgang Achtziger; Christian Kanzow (Math. Program., 2008)

SC 1 optimization reformulations of the generalized Nash equilibrium problem. - Anna von Heusinger; Christian Kanzow (Optim. Methods Softw., 2008)

A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring. - Amir Beck; Aharon Ben-Tal; Christian Kanzow (SIAM J. Matrix Anal. Appl., 2008)

Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions. - Anna von Heusinger; Christian Kanzow (Comput. Optim. Appl., 2009)

On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity. - Christian Kanzow; Izabella Ferenczi; Masao Fukushima (SIAM J. Optim., 2009)

Penalty Methods for the Solution of Generalized Nash Equilibrium Problems. - Francisco Facchinei; Christian Kanzow (SIAM J. Optim., 2010)

Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results. - Christian Kanzow; Alexandra Schwartz (SIAM J. Optim., 2010)

The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions. - Hannes Buchholzer; Christian Kanzow; Peter Knabner; Serge Kräutle (Comput. Optim. Appl., 2011)

Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems. - Axel Dreves; Christian Kanzow (Comput. Optim. Appl., 2011)

On the solution of the KKT conditions of generalized Nash equilibrium problems. - Axel Dreves; Francisco Facchinei; Christian Kanzow; Simone Sagratella (SIAM J. Optim., 2011)

Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems. - Axel Dreves; Christian Kanzow; Oliver Stein (J. Glob. Optim., 2012)

Static prediction games for adversarial learning problems. - Michael Brückner; Christian Kanzow; Tobias Scheffer (J. Mach. Learn. Res., 2012)

Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation. - Anna von Heusinger; Christian Kanzow; Masao Fukushima (Math. Program., 2012)

Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints. - Tim Hoheisel; Christian Kanzow; Alexandra Schwartz (Optim. Methods Softw., 2012)

A smoothing-regularization approach to mathematical programs with vanishing constraints. - Wolfgang Achtziger; Tim Hoheisel; Christian Kanzow (Comput. Optim. Appl., 2013)

A globalized Newton method for the computation of normalized Nash equilibria. - Axel Dreves; Anna von Heusinger; Christian Kanzow; Masao Fukushima (J. Glob. Optim., 2013)

Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints. - Tim Hoheisel; Christian Kanzow; Alexandra Schwartz (Math. Program., 2013)

Formulation and Numerical Solution of Nash Equilibrium Multiobjective Elliptic Control Problems. - Alfio Borzì; Christian Kanzow (SIAM J. Control. Optim., 2013)

A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties. - Christian Kanzow; Alexandra Schwartz (SIAM J. Optim., 2013)

Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints. - Christian Kanzow; Alexandra Schwartz (Comput. Optim. Appl., 2014)

Lottery versus all-pay auction contests: A revenue dominance theorem. - Jörg Franke; Christian Kanzow; Wolfgang Leininger; Alexandra Schwartz (Games Econ. Behav., 2014)

On a Smooth Dual Gap Function for a Class of Quasi-Variational Inequalities. - Nadja Harms; Tim Hoheisel; Christian Kanzow (J. Optim. Theory Appl., 2014)

Solving quasi-variational inequalities via their KKT conditions. - Francisco Facchinei; Christian Kanzow; Simone Sagratella (Math. Program., 2014)

Smoothness properties of a regularized gap function for quasi-variational inequalities. - Nadja Harms; Christian Kanzow; Oliver Stein (Optim. Methods Softw., 2014)

The semismooth Newton method for the solution of quasi-variational inequalities. - Francisco Facchinei; Christian Kanzow; Sebastian Karl; Simone Sagratella (Comput. Optim. Appl., 2015)

On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems. - Nadja Harms; Tim Hoheisel; Christian Kanzow (J. Optim. Theory Appl., 2015)

The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited. - Christian Kanzow; Alexandra Schwartz (Math. Oper. Res., 2015)

On Newton's Method for the Fermat-Weber Location Problem. - Simone Görner; Christian Kanzow (J. Optim. Theory Appl., 2016)

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints. - Michal Cervinka; Christian Kanzow; Alexandra Schwartz (Math. Program., 2016)

On the multiplier-penalty-approach for quasi-variational inequalities. - Christian Kanzow (Math. Program., 2016)

Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method. - Oleg P. Burdakov; Christian Kanzow; Alexandra Schwartz (SIAM J. Optim., 2016)

Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems. - Christian Kanzow; Daniel Steck (SIAM J. Optim., 2016)

Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces. - Christian Kanzow; Yekini Shehu (Comput. Optim. Appl., 2017)

An example comparing the standard and safeguarded augmented Lagrangian methods. - Christian Kanzow; Daniel Steck (Oper. Res. Lett., 2017)

A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties. - Leonardo Galli; Christian Kanzow; Marco Sciandrone (Comput. Optim. Appl., 2018)

Augmented Lagrangian and exact penalty methods for quasi-variational inequalities. - Christian Kanzow; Daniel Steck (Comput. Optim. Appl., 2018)

On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces. - Christian Kanzow; Daniel Steck (SIAM J. Control. Optim., 2018)

An Augmented Lagrangian Method for Optimization Problems in Banach Spaces. - Christian Kanzow; Daniel Steck; Daniel Wachsmuth (SIAM J. Control. Optim., 2018)

Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces. - Eike Börgens; Christian Kanzow (Comput. Optim. Appl., 2019)

Improved local convergence results for augmented Lagrangian methods in $${ varvec{C}}^ mathbf{2}$$ C 2 -cone reducible constrained optimization. - Christian Kanzow; Daniel Steck (Math. Program., 2019)

Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces. - Eike Börgens; Christian Kanzow; Daniel Steck (SIAM J. Control. Optim., 2019)

The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces. - Christian Kanzow; Veronika Karl; Daniel Steck; Daniel Wachsmuth (SIAM J. Optim., 2019)

Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods. - Christian Kanzow; Daniel Steck (SIAM J. Optim., 2019)

New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions. - Eike Börgens; Christian Kanzow; Patrick Mehlitz; Gerd Wachsmuth (SIAM J. Optim., 2020)

Globalized inexact proximal Newton-type methods for nonconvex composite functions. - Christian Kanzow; Theresa Lechner (Comput. Optim. Appl., 2021)

Correction to: Globalized inexact proximal Newton-type methods for nonconvex composite functions. - Christian Kanzow; Theresa Lechner (Comput. Optim. Appl., 2021)

Sequential optimality conditions for cardinality-constrained optimization problems with applications. - Christian Kanzow; Andreas B. Raharja; Alexandra Schwartz (Comput. Optim. Appl., 2021)

An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems. - Christian Kanzow; Andreas B. Raharja; Alexandra Schwartz (J. Optim. Theory Appl., 2021)

Relaxation schemes for mathematical programmes with switching constraints. - Christian Kanzow; Patrick Mehlitz; Daniel Steck (Optim. Methods Softw., 2021)

ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces. - Eike Börgens; Christian Kanzow (SIAM J. Optim., 2021)

COAP 2021 Best Paper Prize. - Christian Kanzow; Theresa Lechner (Comput. Optim. Appl., 2022)

Convergence Properties of Monotone and Nonmonotone Proximal Gradient Methods Revisited. - Christian Kanzow; Patrick Mehlitz (J. Optim. Theory Appl., 2022)

Constrained composite optimization and augmented Lagrangian methods. - Alberto De Marchi; Xiaoxi Jia; Christian Kanzow; Patrick Mehlitz (Math. Program., 2023)

An augmented Lagrangian method for optimization problems with structured geometric constraints. - Xiaoxi Jia; Christian Kanzow; Patrick Mehlitz; Gerd Wachsmuth (Math. Program., 2023)

Inexact penalty decomposition methods for optimization problems with geometric constraints. - Christian Kanzow; Matteo Lapucci (Comput. Optim. Appl., 2023)

Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization. - Christian Kanzow; Daniel Steck (Math. Program. Comput., 2023)

Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka-Łojasiewicz Property Without Global Lipschitz Assumptions. - Xiaoxi Jia; Christian Kanzow; Patrick Mehlitz (SIAM J. Optim., 2023)

Automatic Adversarial Adaption for Stealthy Poisoning Attacks in Federated Learning. - Torsten Krauß; Jan König; Alexandra Dmitrienko; Christian Kanzow (NDSS, 2024)

A bundle-type method for nonsmooth DC programs. - Christian Kanzow; Tanja Neder (J. Glob. Optim., 2024)

An inexact regularized proximal Newton method without line search. - Simeon vom Dahl; Christian Kanzow (Comput. Optim. Appl., 2024)

The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results. - Christian Kanzow; Alexandra Schwartz; Felix Weiß (Comput. Optim. Appl., 2025)

Convergence of Nonmonotone Proximal Gradient Methods under the Kurdyka-Łojasiewicz Property without a Global Lipschitz Assumption. - Christian Kanzow; Leo Lehmann (J. Optim. Theory Appl., 2025)