Pages that link to "Item:Q2746550"
From MaRDI portal
The following pages link to A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization. (Q2746550):
Displaying 13 items.
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
- Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence (Q2765150) (← links)
- An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization (Q3161129) (← links)
