The following pages link to Christian Kanzow (Q205950):
Displaying 50 items.
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q1765264) (← links)
- On finite termination of an iterative method for linear complementarity problems (Q1814795) (← links)
- On the resolution of monotone complementarity problems (Q1815077) (← links)
- Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter (Q1856363) (← links)
- Nonlinear complementarity as unconstrained optimization (Q1908649) (← links)
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
- Effort maximization in asymmetric contest games with heterogeneous contestants (Q1949200) (← links)
- Feasible descent algorithms for mixed complementarity problems (Q1968793) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- Sequential optimality conditions for cardinality-constrained optimization problems with applications (Q2044577) (← links)
- An augmented Lagrangian method for cardinality-constrained optimization problems (Q2046539) (← links)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
- Book review of: Y. Cui and J.-S. Pang, Modern nonconvex nondifferentiable optimization (Q2143338) (← links)
- Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization (Q2316626) (← links)
- Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces (Q2364129) (← links)
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications (Q2382702) (← links)
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints (Q2385544) (← links)
- A globalized Newton method for the computation of normalized Nash equilibria (Q2392752) (← links)
- A smoothing-regularization approach to mathematical programs with vanishing constraints (Q2393647) (← links)
- Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces (Q2419566) (← links)
- Bounds for the extremal eigenvalues of a class of symmetric tridiagonal matrices with applications (Q2427886) (← links)
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation (Q2429460) (← links)
- Lottery versus all-pay auction contests: a revenue dominance theorem (Q2437170) (← links)
- Solving quasi-variational inequalities via their KKT conditions (Q2452385) (← links)
- Equivalence of two nondegeneracy conditions for semidefinite programs (Q2483041) (← links)
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints (Q2483990) (← links)
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization (Q2565032) (← links)
- On M-stationary points for mathematical programs with equilibrium constraints (Q2566118) (← links)
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints (Q2642976) (← links)
- An active set-type Newton method for constrained nonlinear systems (Q2760103) (← links)
- An infeasible interior proximal method for convex programming problems with linear constraints (Q2764699) (← links)
- Theory and numerics of constrained problems of optimization (Q2782041) (← links)
- Augmented Lagrangian methods for the solution of generalized Nash equilibrium problems (Q2826819) (← links)
- A new regularization method for mathematical programs with complementarity constraints with strong convergence properties (Q2848173) (← links)
- The semismooth algorithm for large scale complementarity problems (Q2884511) (← links)
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints (Q2885492) (← links)
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties (Q2903144) (← links)
- Smoothness properties of a regularized gap function for quasi-variational inequalities (Q2926051) (← links)
- On a Reformulation of Mathematical Programs with Cardinality Constraints (Q2942449) (← links)
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems (Q3083285) (← links)
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results (Q3083306) (← links)
- On the solution of the KKT conditions of generalized Nash equilibrium problems (Q3105791) (← links)
- A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints (Q3436940) (← links)
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints (Q3534641) (← links)
- <i>SC</i><sup>1</sup>optimization reformulations of the generalized Nash equilibrium problem (Q3605211) (← links)
- A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring (Q3609034) (← links)
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints (Q3632706) (← links)
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities (Q4210335) (← links)
- On the Accurate Identification of Active Constraints (Q4229470) (← links)
- (Q4252824) (← links)
