Pages that link to "Item:Q943517"
From MaRDI portal
The following pages link to A quadratically approximate framework for constrained optimization, global and local convergence (Q943517):
Displaying 6 items.
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← 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)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
