Christian Kanzow
Orcid: 0000-0003-2897-2509Affiliations:
- Julius Maximilian University of Würzburg, Germany
According to our database1,
Christian Kanzow
authored at least 95 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka-Łojasiewicz Property Without Global Lipschitz Assumptions.
SIAM J. Optim., December, 2023
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization.
Math. Program. Comput., September, 2023
Inexact penalty decomposition methods for optimization problems with geometric constraints.
Comput. Optim. Appl., July, 2023
An augmented Lagrangian method for optimization problems with structured geometric constraints.
Math. Program., May, 2023
Math. Program., 2023
2022
Convergence Properties of Monotone and Nonmonotone Proximal Gradient Methods Revisited.
J. Optim. Theory Appl., 2022
2021
SIAM J. Optim., 2021
Optim. Methods Softw., 2021
J. Optim. Theory Appl., 2021
Sequential optimality conditions for cardinality-constrained optimization problems with applications.
Comput. Optim. Appl., 2021
Correction to: Globalized inexact proximal Newton-type methods for nonconvex composite functions.
Comput. Optim. Appl., 2021
Comput. Optim. Appl., 2021
2020
New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions.
SIAM J. Optim., 2020
2019
Quasi-Variational Inequalities in Banach Spaces: Theory and Augmented Lagrangian Methods.
SIAM J. Optim., 2019
The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces.
SIAM J. Optim., 2019
Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces.
SIAM J. Control. Optim., 2019
Improved local convergence results for augmented Lagrangian methods in $${\varvec{C}}^\mathbf{2}$$ C 2 -cone reducible constrained optimization.
Math. Program., 2019
Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces.
Comput. Optim. Appl., 2019
2018
SIAM J. Control. Optim., 2018
SIAM J. Control. Optim., 2018
Comput. Optim. Appl., 2018
A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties.
Comput. Optim. Appl., 2018
2017
Oper. Res. Lett., 2017
Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces.
Comput. Optim. Appl., 2017
2016
Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems.
SIAM J. Optim., 2016
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method.
SIAM J. Optim., 2016
Math. Program., 2016
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints.
Math. Program., 2016
J. Optim. Theory Appl., 2016
2015
The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited.
Math. Oper. Res., 2015
On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems.
J. Optim. Theory Appl., 2015
Comput. Optim. Appl., 2015
2014
Smoothness properties of a regularized gap function for quasi-variational inequalities.
Optim. Methods Softw., 2014
Math. Program., 2014
J. Optim. Theory Appl., 2014
Games Econ. Behav., 2014
Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints.
Comput. Optim. Appl., 2014
2013
A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties.
SIAM J. Optim., 2013
Formulation and Numerical Solution of Nash Equilibrium Multiobjective Elliptic Control Problems.
SIAM J. Control. Optim., 2013
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints.
Math. Program., 2013
J. Glob. Optim., 2013
A smoothing-regularization approach to mathematical programs with vanishing constraints.
Comput. Optim. Appl., 2013
2012
Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints.
Optim. Methods Softw., 2012
Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation.
Math. Program., 2012
J. Mach. Learn. Res., 2012
Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems.
J. Glob. Optim., 2012
2011
SIAM J. Optim., 2011
Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems.
Comput. Optim. Appl., 2011
The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions.
Comput. Optim. Appl., 2011
2010
Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results.
SIAM J. Optim., 2010
SIAM J. Optim., 2010
2009
On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity.
SIAM J. Optim., 2009
Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions.
Comput. Optim. Appl., 2009
2008
A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring.
SIAM J. Matrix Anal. Appl., 2008
<i>SC</i> <sup>1</sup> optimization reformulations of the generalized Nash equilibrium problem.
Optim. Methods Softw., 2008
Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications.
Math. Program., 2008
2007
Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems.
Optim. Methods Softw., 2007
An interior-point affine-scaling trust-region method for semismooth equations with box constraints.
Comput. Optim. Appl., 2007
2006
On Affine-Scaling Interior-Point Newton Methods for Nonlinear Minimization with Bound Constraints.
Comput. Optim. Appl., 2006
2005
Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity.
SIAM J. Optim., 2005
Comput. Optim. Appl., 2005
2004
Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results.
SIAM J. Optim., 2004
On a semismooth least squares formulation of complementarity problems with gap reduction.
Optim. Methods Softw., 2004
Optim. Methods Softw., 2004
2002
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results.
SIAM J. Optim., 2002
Numerische Mathematik, 2002
Predictor-Corrector Smoothing Methods for Linear Programs with a More Flexible Update of the Smoothing Parameter.
Comput. Optim. Appl., 2002
2001
Numerische Mathematik, 2001
INFORMS J. Comput., 2001
Ann. Oper. Res., 2001
2000
SIAM J. Optim., 2000
J. Glob. Optim., 2000
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems.
Comput. Optim. Appl., 2000
1999
SIAM J. Optim., 1999
Math. Program., 1999
1998
SIAM J. Optim., 1998
Solving box constrained variational inequalities by using the natural residual with D-gap function globalization.
Oper. Res. Lett., 1998
Numerische Mathematik, 1998
Math. Program., 1998
Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities.
Math. Program., 1998
A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems.
Comput. Optim. Appl., 1998
1997
A new approach to continuation methods for complementarity problems with uniform P-functions.
Oper. Res. Lett., 1997
1996
SIAM J. Matrix Anal. Appl., 1996
Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems.
SIAM J. Optim., 1996
A semismooth equation approach to the solution of nonlinear complementarity problems.
Math. Program., 1996
Math. Program., 1996
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems.
Math. Program., 1996
1994
An unconstrained optimization technique for large-scale linearly constrained convex minimization problems.
Computing, 1994