Pages that link to "Item:Q1071653"
From MaRDI portal
The following pages link to A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653):
Displaying 14 items.
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- A new successive quadratic programming algorithm (Q1210225) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- A two-parameter exact penalty function for nonlinear programming (Q1337206) (← links)
- Exact penalty function algorithm with simple updating of the penalty parameter (Q2277155) (← links)
- A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
- Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
- A robust trust region method for nonlinear optimization with inequality constraint (Q2496002) (← links)
- A sequential quadratic programming method for potentially infeasible mathematical programs (Q2640450) (← links)
- Decentralized Cooperative Optimization for Multi-criteria Decision Making (Q3564108) (← links)
- A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348) (← links)
