Pages that link to "Item:Q5653813"
From MaRDI portal
The following pages link to Penalty function versus non-penalty function methods for constrained nonlinear programming problems (Q5653813):
Displayed 11 items.
- Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives (Q1142159) (← links)
- A globally and quadratically convergent algorithm for general nonlinear programming problems (Q1151728) (← links)
- On the global and superlinear convergence of a discretized version of Wilson's method (Q1166896) (← links)
- A recursive quadratic programming algorithm for semi-infinite optimization problems (Q1169401) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- A geometric method in nonlinear programming (Q1253613) (← links)
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms (Q4047415) (← links)
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems (Q4136969) (← links)
- Computational experience in sensitivity analysis for nonlinear programming (Q4770792) (← links)
- A quadratically-convergent algorithm for general nonlinear programming problems (Q5682162) (← links)