A variant of feasible descent SQP method for inequality constrained optimization
From MaRDI portal
Recommendations
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A feasible SQP descent method for inequality constrained optimization problems and its convergence
- An efficient feasible SQP algorithm for inequality constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A variant of SQP method for inequality constrained optimization and its global convergence
Cited in
(12)- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- A sequential quadratically constrained quadratic programming method of feasible directions
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- On the global convergence for a variant of SQP method
- An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization
- A feasible SQP descent method for inequality constrained optimization problems and its convergence
- scientific article; zbMATH DE number 5647820 (Why is no real title available?)
- A globally and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- An efficient feasible SQP algorithm for inequality constrained optimization
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
This page was built for publication: A variant of feasible descent SQP method for inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162361)
