Pages that link to "Item:Q939555"
From MaRDI portal
The following pages link to A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555):
Displayed 6 items.
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- A method of sequential log-convex programming for engineering design (Q6050371) (← links)