A robust secant method for optimization problems with inequality constraints
- 1 April 1981
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 33 (4) , 463-477
- https://doi.org/10.1007/bf00935753
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Combined phase I—phase II methods of feasible directionsMathematical Programming, 1979
- An outer approximations algorithm for computer-aided design problemsJournal of Optimization Theory and Applications, 1979
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations AlgorithmsSIAM Journal on Control and Optimization, 1979
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- Dual Variable Metric Algorithms for Constrained OptimizationSIAM Journal on Control and Optimization, 1977
- Superlinearly convergent variable metric algorithms for general nonlinear programming problemsMathematical Programming, 1976
- A modified secant method for unconstrained minimizationMathematical Programming, 1974
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithmsMathematical Programming, 1974
- A Globally Converging Secant Method with Applications to Boundary Value ProblemsSIAM Journal on Numerical Analysis, 1974
- Extension of Newton's method to nonlinear functions with values in a coneNumerische Mathematik, 1972