A nonmonotone line search technique for Newton's method
SIAM Journal on Numerical Analysis
On the regularity of the Kuhn-Tucker curve
SIAM Journal on Control and Optimization
On iterated minimization in nonconvex optimization
Mathematics of Operations Research
Newton's method for B-differentiable equations
Mathematics of Operations Research
On concepts of directional differentiability
Journal of Optimization Theory and Applications
Globally convergent Newton methods for nonsmooth equations
Mathematics of Operations Research
A nonsmooth version of Newton's method
Mathematical Programming: Series A and B
A trust region algorithm for minimization of locally Lipschitzian functions
Mathematical Programming: Series A and B
Global convergence of damped Newton's method for nonsmooth equations via the path search
Mathematics of Operations Research
Superlinearly convergent approximate Newton methods for LC1 optimization problems
Mathematical Programming: Series A and B
A globally convergent Newton method for convex SC1minimization problems
Journal of Optimization Theory and Applications
A unified approach to global convergence of trust region methods for nonsmooth optimization
Mathematical Programming: Series A and B
Directional derivatives of the solution of a parametric nonlinear program
Mathematical Programming: Series A and B
A semismooth equation approach to the solution of nonlinear complementarity problems
Mathematical Programming: Series A and B
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems
Journal of Global Optimization
Journal of Computational and Applied Mathematics - Special issue: Papers presented at the 1st Sino--Japan optimization meeting, 26-28 October 2000, Hong Kong, China
Global convergence of nonmonotone descent methods for unconstrained optimization problems
Journal of Computational and Applied Mathematics - Special issue: Papers presented at the 1st Sino--Japan optimization meeting, 26-28 October 2000, Hong Kong, China
BI-Level Strategies in Semi-Infinite Programming
BI-Level Strategies in Semi-Infinite Programming
A Smoothing Newton Method for Semi-Infinite Programming
Journal of Global Optimization
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications (Nonconvex Optimization and Its Applications)
The semismooth approach for semi-infinite programming under the Reduction Ansatz
Journal of Global Optimization
Generalized Nash equilibrium problems and Newton methods
Mathematical Programming: Series A and B
SC1 optimization reformulations of the generalized Nash equilibrium problem
Optimization Methods & Software
Computational Optimization and Applications
The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
SIAM Journal on Optimization
Minimization of SC1 functions and the Maratos effect
Operations Research Letters
Robust solutions of uncertain linear programs
Operations Research Letters
Generalized Semi-Infinite Programming: The Nonsmooth Symmetric Reduction Ansatz
SIAM Journal on Optimization
| Hi-index | 0.00 |
In [S. Bütikofer, Math. Methods Oper. Res., 68 (2008), pp. 235-256] a nonsmooth Newton method globalized with the aid of a path search was developed in an abstract framework. We refine the convergence analysis given there and adapt this algorithm to certain finite dimensional optimization problems with $C^{1,1}$ data. Such problems arise, for example, in semi-infinite programming under a reduction approach without strict complementarity and in generalized Nash equilibrium models. Using results from parametric optimization and variational analysis, we work out in detail the concrete Newton schemes and the construction of a path for these applications and discuss a series of numerical results for semi-infinite and generalized semi-infinite optimization problems.