A robust secant method for optimization problems with inequality constraints
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3508256 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Globally Converging Secant Method with Applications to Boundary Value Problems
- A globally convergent method for nonlinear programming
- A modified secant method for unconstrained minimization
- An outer approximations algorithm for computer-aided design problems
- Combined phase I—phase II methods of feasible directions
- Dual Variable Metric Algorithms for Constrained Optimization
- Extension of Newton's method to nonlinear functions with values in a cone
- On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(7)- Computer-aided design via optimization: A review
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- On a class fo hybrid methods for smooth constrained optimization
- Convergent stepsizes for constrained optimization algorithms
- Gradient subspace approximation: a direct search method for memetic computing
- On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
This page was built for publication: A robust secant method for optimization problems with inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1136347)
