A robust secant method for optimization problems with inequality constraints
From MaRDI portal
Publication:1136347
DOI10.1007/BF00935753zbMath0427.49027OpenAlexW1992618294MaRDI QIDQ1136347
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00935753
Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Related Items
Gradient subspace approximation: a direct search method for memetic computing, Computer-aided design via optimization: A review, A recursive quadratic programming algorithm for semi-infinite optimization problems, Convergent stepsizes for constrained optimization algorithms, On a class fo hybrid methods for smooth constrained optimization, Equality and inequality constrained optimization algorithms with convergent stepsizes, On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
Cites Work
- A globally convergent method for nonlinear programming
- An outer approximations algorithm for computer-aided design problems
- Extension of Newton's method to nonlinear functions with values in a cone
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Dual Variable Metric Algorithms for Constrained Optimization
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Combined phase I—phase II methods of feasible directions
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- A Globally Converging Secant Method with Applications to Boundary Value Problems
- A modified secant method for unconstrained minimization
- Unnamed Item
- Unnamed Item
