Solution of monotone complementarity problems with locally Lipschitzian functions

A Fischer - Mathematical Programming, 1997 - Springer
The paper deals with complementarity problems CP (F), where the underlying function F is
assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP (F) as …

A regularized semi-smooth Newton method with projection steps for composite convex programs

X **ao, Y Li, Z Wen, L Zhang - Journal of Scientific Computing, 2018 - Springer
The goal of this paper is to study approaches to bridge the gap between first-order and
second-order type methods for composite convex programs. Our key observations are:(1) …

Error bounds of generalized D-gap functions for nonsmooth and nonmonotone variational inequality problems

G Li, KF Ng - SIAM Journal on Optimization, 2009 - SIAM
Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone
Variational Inequality Problems Page 1 Copyright © by SIAM. Unauthorized reproduction of …

A globally convergent Newton method for convex SC1 minimization problems

JS Pang, L Qi - Journal of Optimization Theory and Applications, 1995 - Springer
This paper presents a globally convergent and locally superlinearly convergent method for
solving a convex minimization problem whose objective function has a semismooth but …

On the multiplier-penalty-approach for quasi-variational inequalities

C Kanzow - Mathematical Programming, 2016 - Springer
The multiplier-penalty approach is one of the classical methods for the solution of
constrained optimization problems. This method was generalized to the solution of quasi …

An augmented Lagrangian method for quasi-equilibrium problems

LF Bueno, G Haeser, F Lara, FN Rojas - Computational Optimization and …, 2020 - Springer
In this paper, we propose an Augmented Lagrangian algorithm for solving a general class of
possible non-convex problems called quasi-equilibrium problems (QEPs). We define an …

Characterizations of generalized monotone nonsmooth continuous maps using approximate Jacobians.

V Jeyakumar, DT Luc, S Schaible - Journal of Convex analysis, 1998 - emis.de
The concern of this international mathematical journal is to disseminate theoretical
knowledge in the field of Convex Analysis and, at the same time, cultivate and extend its …

An augmented lagrangian primal-dual semismooth newton method for multi-block composite optimization

Z Deng, K Deng, J Hu, Z Wen - Journal of Scientific Computing, 2025 - Springer
In this paper, we develop a novel primal-dual semismooth Newton method for solving
linearly constrained multi-block convex composite optimization problems. First, a …

Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities

C Kanzow, M Fukushima - Mathematical Programming, 1998 - Springer
The D-gap function, recently introduced by Peng and further studied by Yamashita et al.,
allows a smooth unconstrained minimization reformulation of the general variational …

[HTML][HTML] Solving variational inequality problems via smoothing-nonsmooth reformulations

D Sun, L Qi - Journal of computational and applied mathematics, 2001 - Elsevier
It has long been known that variational inequality problems can be reformulated as
nonsmooth equations. Recently, locally high-order convergent Newton methods for …