Superlinearly convergent approximate Newton methods for LC1 optimization problems
- 1 March 1994
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 64 (1-3) , 277-294
- https://doi.org/10.1007/bf01582577
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Nonsmooth Equations: Motivation and AlgorithmsSIAM Journal on Optimization, 1993
- Convergence Analysis of Some Algorithms for Solving Nonsmooth EquationsMathematics of Operations Research, 1993
- Minimization of Locally Lipschitzian FunctionsSIAM Journal on Optimization, 1991
- Semismoothness and decomposition of maximal normal operatorsJournal of Mathematical Analysis and Applications, 1990
- Generalized Hessian matrix and second-order optimality conditions for problems withC 1,1 dataApplied Mathematics & Optimization, 1984
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable ProblemsSIAM Journal on Control and Optimization, 1983
- Semismooth and Semiconvex Functions in Constrained OptimizationSIAM Journal on Control and Optimization, 1977
- Superlinearly convergent variable metric algorithms for general nonlinear programming problemsMathematical Programming, 1976
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problemsMathematical Programming, 1976
- Penalty function versus non-penalty function methods for constrained nonlinear programming problemsMathematical Programming, 1971