A globally and quadratically convergent algorithm for general nonlinear programming problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3590072 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
- A computational comparison of some non-linear programs
- A quadratically-convergent algorithm for general nonlinear programming problems
- A superlinearly convergent method for minimization problems with linear inequality constraints
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems
Cited in
(9)- Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens
- Dual techniques for constrained optimization
- Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives
- On a class fo hybrid methods for smooth constrained optimization
- A hybrid method fur linearly constrained optimisation problems
- A class on nonmonotone stabilization methods in unconstrained optimization
- On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
- On the global and superlinear convergence of a discretized version of Wilson's method
- Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
This page was built for publication: A globally and quadratically convergent algorithm for general nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151728)
