A recursive quadric programming algorithm that uses new nondifferentiable penalty functions
The problem considered in this paper is the equality-constrained nonlinear programming problem \[ \text{minimize } f(x)\text{ subject to } C(x)= 0,\tag{P} \] where \(f: \mathbb{R}^ n\to \mathbb{R}\), \(C: \mathbb{R}^ n\to \mathbb{R}^ m\) are twice continuously differentiable. For the solution of (P) a recursive quadratic programming algorithm is proposed which uses Han's nondifferentiable penalty functions together with a second order penalty term and Fukushima's mixed direction as the line search direction. Finally, under some particular assumptions, the method is proved to be globally convergent as well as locally convergent of second order.
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- scientific article; zbMATH DE number 7590223
- scientific article; zbMATH DE number 621945
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- scientific article; zbMATH DE number 621945 (Why is no real title available?)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
This page was built for publication: A recursive quadric programming algorithm that uses new nondifferentiable penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333897)
