Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization
- 1 November 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 34 (6) , 2051-2063
- https://doi.org/10.1137/s0363012994274823
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Linear-quadratic programming problems with stochastic penalties: The finite generation algorithmPublished by Springer Nature ,2005
- An SQP algorithm for extended linear-quadratic problems in stochastic programmingAnnals of Operations Research, 1995
- Local Uniqueness and Convergence of Iterative Methods for Nonsmooth Variational InequalitiesJournal of Mathematical Analysis and Applications, 1995
- Minimization of SC1 functions and the Maratos effectOperations Research Letters, 1995
- A parameterized Newton method and a quasi-Newton method for nonsmooth equationsComputational Optimization and Applications, 1994
- Least change update methods for nonlinear systems with nondifferentiable terms∗Numerical Functional Analysis and Optimization, 1993
- On the Relation between Two Local Convergence Theories of Least-Change Secant Update MethodsMathematics of Computation, 1992
- A dual solution procedure for quadratic stochastic programs with simple recourseLecture Notes in Mathematics, 1983
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974
- On the Local and Superlinear Convergence of Quasi-Newton MethodsIMA Journal of Applied Mathematics, 1973